Planar graphs without intersecting 5-cycles are 4-choosable

DOI10.1016/J.DISC.2017.03.012MaRDI QIDQ2397522zbMATHOpenAlexFDO

Authors Dai-Qiang Hu, Jian-Liang Wu

Publication date 22 May 2017

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

list coloringcycleplanar graphchoosable graphs

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

• Planar graphs without chordal 6-cycles are 4-choosable
• The 4-choosability of plane graphs without 4-cycles
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• The 4-choosability of planar graphs without 6-cycles
• A new sufficient condition for a toroidal graph to be 4-choosable

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• A not 3-choosable planar graph without 3-cycles
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Choosability and edge choosability of planar graphs without five cycles
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• Graph theory
• List colourings of planar graphs
• Multicriterial graph problems with MAXMIN criterion
• On structure of some plane graphs with application to choosability
• Planar Graphs without 7-Cycles Are 4-Choosable
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• Planar graphs without cycles of specific lengths
• The 4-choosability of plane graphs without 4-cycles

Cited in

(21)

• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• A local condition for planar graphs to be 4-choosable
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• A new sufficient condition for a toroidal graph to be 4-choosable
• Graphs with two crossings are 5-choosable
• On \((3, r)\)-choosability of some planar graphs
• Planar Graphs without 7-Cycles Are 4-Choosable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• 5-choosability of graphs with crossings far apart
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
• List coloring and diagonal coloring for plane graphs of diameter two
• DP-4-coloring of planar graphs with some restrictions on cycles
• A sufficient condition for planar graphs to be DP-4-colorable
• Planar graphs without intersecting 5-cycles are signed-4-choosable
• DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
• Planar graphs without chordal 5-cycles are 2-good
• Every 1-planar graph without cycles of length 3 or 4 is 5-colorable
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• On 3-choosable planar graphs of girth at least 4
• The 4-choosability of planar graphs without 6-cycles

This page was built for publication: Planar graphs without intersecting 5-cycles are 4-choosable

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