Some structural properties of planar graphs and their applications to 3-choosability

DOI10.1016/J.DISC.2011.09.028MaRDI QIDQ658061zbMATH OpenOpenAlexFDO

Authors Min Chen, Mickaël Montassier, André Raspaud

Publication date 11 January 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• A note on 3-choosability of planar graphs
• On 3-choosability of planar graphs without certain cycles
• On 3-choosability of planar graphs without certain cycles
• On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
• A note on 3-choosability of plane graphs under distance restrictions

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• 25 pretty graph colouring problems
• A non-3-choosable planar graph without cycles of length 4 and 5
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs without certain cycles
• A sufficient condition for a planar graph to be 3-choosable
• Every planar graph is 5-choosable
• List colourings of planar graphs
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

Cited in

(11)

• A note on 3-choosability of planar graphs
• scientific article; zbMATH DE number 5116037 (Why is no real title available?)
• scientific article; zbMATH DE number 5914884 (Why is no real title available?)
• scientific article; zbMATH DE number 5064026 (Why is no real title available?)
• Planar graphs that have non short cycles with a chord are 3-choosable
• scientific article; zbMATH DE number 6873968 (Why is no real title available?)
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs related to Montanssier's conjecture
• A note on 3-choosability of plane graphs under distance restrictions
• scientific article; zbMATH DE number 3946181 (Why is no real title available?)
• A structural theorem for planar graphs with some applications

This page was built for publication: Some structural properties of planar graphs and their applications to 3-choosability

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