Planar graphs without triangular 4-cycles are 3-choosable

zbMath1299.05116MaRDI QIDQ2454484

Anna O. Ivanova, Oleg V. Borodin

Publication date: 13 June 2014

Published in: Sibirskie Èlektronnye 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)

Related Items (14)

\((4,2)\)-choosability of planar graphs with forbidden structures ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Choosability with union separation ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Variable degeneracy on toroidal graphs ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable ⋮ 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

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