Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Mahsa Mozafari-Nia"'
Publikováno v:
Opuscula Mathematica, Vol 43, Iss 1, Pp 109-123 (2022)
For any \(n\in \mathbb{N}\), the \(n\)-subdivision of a graph \(G\) is a simple graph \(G^\frac{1}{n}\) which is constructed by replacing each edge of \(G\) with a path of length \(n\). The \(m\)-th power of \(G\) is a graph, denoted by \(G^m\), with
Externí odkaz:
https://doaj.org/article/3ddc913ea0d54da4b48e106f63983e41
Publikováno v:
Opuscula Mathematica. 43:109-123
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbaf212e71970f21b33b9aea96f58304
https://doi.org/10.7494/opmath.2023.43.1.109
https://doi.org/10.7494/opmath.2023.43.1.109
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:245
A $vi$-simultaneous proper $k$-coloring of a graph $G$ is a coloring of all vertices and incidences of the graph in which any two adjacent or incident elements in the set $V(G)\cup I(G)$ receive distinct colors, where $I(G)$ is the set of incidences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3e677faf412da8de4d88c52f21b09a7
https://doi.org/10.5614/ejgta.2023.11.1.20
https://doi.org/10.5614/ejgta.2023.11.1.20