Conditional colorings of graphs

From MaRDI portal
Publication:2501581

DOI10.1016/j.disc.2006.03.052zbMath1102.05022OpenAlexW2097915624MaRDI QIDQ2501581

Taozhi Shui, Suohai Fan, Hong-Jian Lai, Jian-Liang Lin, B. L. Montgomery

Publication date: 14 September 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.052



Related Items

Element deletion changes in dynamic coloring of graphs, Dynamic coloring of graphs having no \(K_5\) minor, On the \(r\)-dynamic coloring of subdivision-edge coronas of a path, On the \(r\)-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph, On the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycle, Graph \(r\)-hued colorings -- a survey, Linear list r-hued coloring of sparse graphs, On list \(r\)-hued coloring of planar graphs, On \(r\)-hued coloring of \(K_4\)-minor free graphs, On the dynamic coloring of graphs, Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs, On \(r\)-hued colorings of graphs without short induced paths, On \(r\)-hued coloring of planar graphs with girth at least 6, Optimal \(r\)-dynamic coloring of sparse graphs, Weak-dynamic coloring of graphs beyond-planarity, On dynamic coloring for planar graphs and graphs of higher genus, Optimal secret share distribution in degree splitting communication networks, On r-hued coloring of product graphs, The list \(r\)-hued coloring of \(K_{m, n}\), On the difference between chromatic number and dynamic chromatic number of graphs, List \(r\)-hued chromatic number of graphs with bounded maximum average degrees, On defected colourings of graphs, Dynamic coloring and list dynamic coloring of planar graphs, The 2nd-order conditional 3-coloring of claw-free graphs, List \(r\)-dynamic coloring of graphs with small maximum average degree, Upper bounds of \(r\)-hued colorings of planar graphs, On the list dynamic coloring of graphs, Dynamic chromatic number of regular graphs, Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number, 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs, Complexity of conditional colorability of graphs, List \(r\)-dynamic coloring of sparse graphs, On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs, Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks, On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph



Cites Work