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

(26)

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