Results 231 to 240 of about 135,434 (260)
Some of the next articles are maybe not open access.
Joins of paths and cycles of equal order with sigma chromatic number 2
, 2021For a simple connected graph [Formula: see text] let [Formula: see text] be a coloring of [Formula: see text] where two adjacent vertices may be assigned the same color.
A. Garciano +2 more
semanticscholar +1 more source
The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs
2010 4th International Conference on Bioinformatics and Biomedical Engineering, 2010Let $G=(V,E)$ be a graph and $f$:$(V\cup E)\rightarrow [k]$ be a proper total $k$-coloring of $G$.We say that $f$ is an adjacent vertex distinguishing total coloring if for any two adjacent vertices,the set of colors appearing on the vertex and incident edges are different.We call the smallest $k$ for which such a coloring of $G$ exists the adjacent ...
Zhiwen Wang, Enqiang Zhu
openaire +1 more source
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
Information Processing Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, M. R., Guo, X. F.
openaire +3 more sources
Local chromatic number and distinguishing the strength of topological obstructions
200522 pages. Main result given more generally.
Simonyi, G��bor +2 more
openaire +1 more source
On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs
2013 International Conference on Information Technology and Applications, 2013In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.
Qiantai Yan, Wuzhuang Li
openaire +1 more source
On the D(β)-vertex-distinguishing acyclic edge chromatic number of graphs
2010 2nd International Conference on Industrial and Information Systems, 2010A proper k-edge coloring of a graph G is called D(β)-vertex-distinguishing acyclic edge coloring, if l)there is no 2-colored cycle in G, and 2)any two vertices whose distance is not larger than β have different color sets, where the color set of a vertex is the set composed of all colors of the edges incident this vertex.
null Liu-Xinsheng, null Wei-Ziying
openaire +1 more source
On the AVD-Total Chromatic Number of 4-Regular Circulant Graphs
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics. An AVD-k -total coloring of a simple graph G is a mapping π : V ( G ) ∪ E ( G ) → { 1 , . . . , k } , with k ≥ 1 such that: for each pair of adjacent or incident elements x, y ∈ V ( G ) ∪ E ( G ) , π ( x ) ̸ = π ( y ) ; and for each pair of adjacent ...
Luerbio Faria, Mauro Nigro, Diana Sasaki
semanticscholar +1 more source
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph
Key Engineering Materials, 2011A total coloring of a simple graph G is called adjacent vertex distinguishing if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u differs from the set of colors assigned to the vertices and the edges incident to v.
openaire +1 more source
Cancer treatment and survivorship statistics, 2022
Ca-A Cancer Journal for Clinicians, 2022Kimberly D Miller +2 more
exaly
Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
Applied Mathematics and Computation, 2017Donglei Yang +4 more
semanticscholar +1 more source