Planar graphs without triangular 4-cycles are 3-choosable

MaRDI QIDQ2454484zbMATH OpenFDO

Authors Oleg V. Borodin, Anna O. Ivanova

Publication date 13 June 2014

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v5/p75-79.pdf

zbMATH Keywords

Euler's formulaSteinberg's conjecture

Mathematics Subject Classification ID

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

Recommendations

• Planar graphs without 4-cycles adjacent to triangles 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
• Planar graphs without chordal 6-cycles are 4-choosable
• A note on 3-choosability of planar graphs without certain cycles

Cited in

(25)

• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Planar Graphs without 7-Cycles Are 4-Choosable
• A sufficient condition for planar graphs to be DP-4-colorable
• Variable degeneracy on toroidal graphs
• A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
• DP-4-coloring of planar graphs with some restrictions on cycles
• Note on 3-choosability of planar graphs with maximum degree 4
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• On structure of some plane graphs with application to choosability
• scientific article; zbMATH DE number 5983740 (Why is no real title available?)
• General parity result and cycle-plus-triangles graphs
• An analogue of DP-coloring for variable degeneracy and its applications
• Choosability with union separation
• A non-3-choosable planar graph without cycles of length 4 and 5
• Cover and variable degeneracy
• A generalization of some results on list coloring and DP-coloring
• On 3-choosability of triangle-free plane graphs
• List coloring and diagonal coloring for plane graphs of diameter two
• Planar graphs without chordal 6-cycles are 4-choosable
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• \((4,2)\)-choosability of planar graphs with forbidden structures
• On sufficient conditions for planar graphs to be 5-flexible
• A sufficient condition for a planar graph to be 4-choosable

This page was built for publication: Planar graphs without triangular 4-cycles are 3-choosable

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