scientific article; zbMATH DE number 7029178

DOI10.3969/J.ISSN.1008-5513.2018.02.12MaRDI QIDQ4625641zbMATH OpenFDO

Authors Qianqian Zhou, Lei Sun

Publication date 22 February 2019

zbMATH Keywords

cyclesplanar graphimproper coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• 2-distance coloring of planar graphs without 4-cycles and 5-cycles
• Improper colorability of planar graphs with cycles of length neither 4 nor 6
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• Improper colorability of planar graphs without prescribed short cycles
• A note on improper colorability of planar graphs
• 2-distance coloring of planar graphs without 4-cycles
• 2-distance coloring of planar graphs without adjacent 5-cycles
• A note on total colorings of planar graphs without 4-cycles
• Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles

Cited in

(7)

• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
• A note on improper colorability of planar graphs
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
• Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
• Improper colorability of planar graphs without prescribed short cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625641)