A note on improper colorability of planar graphs

DOI10.16218/J.ISSN.1001-5051.2017.03.004MaRDI QIDQ4641211zbMATH OpenFDO

Authors Chuanni Zhang, Yingqian Wang

Publication date 25 May 2018

Full work available at URL https://doi.org/10.16218/J.ISSN.1001-5051.2017.03.004

zbMATH Keywords

cyclesdischargingimproper colorabilityplanar graph

Mathematics Subject Classification ID

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

Recommendations

• Improper colorability of planar graphs without prescribed short cycles
• scientific article; zbMATH DE number 7029178
• Improper colorability of planar graphs with cycles of length neither 4 nor 6
• Planar graphs without cycles of length from 4 to 6 are (1,0,0)-colorable
• Note on improper coloring of 1-planar graphs.

Cited in

(5)

• Towards a version of Ohba's conjecture for improper colorings
• List Improper Colourings of Planar Graphs
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
• scientific article; zbMATH DE number 7029178 (Why is no real title available?)
• Note on improper coloring of 1-planar graphs.

This page was built for publication: A note on improper colorability of planar graphs

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