The 4-choosability of plane graphs without 4-cycles

DOI10.1006/jctb.1998.1893zbMath0931.05036OpenAlexW2082129852MaRDI QIDQ1305526

Jiazhuang Liu, Bao-Gang Xu, Peter Che Bor Lam

Publication date: 4 October 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1893

zbMATH Keywords

triangle vertex coloring plane graph faces 4-cycles choosabiilty

Mathematics Subject Classification ID

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

Related Items (44)

On total chromatic number of planar graphs without 4-cycles ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ A new sufficient condition for a toroidal graph to be 4-choosable ⋮ Choosability with union separation of planar graphs without cycles of length 4 ⋮ A small non-\(\mathbb Z_4\)-colorable planar graph ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Choosability in signed planar graphs ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ Variable degeneracy on toroidal graphs ⋮ On-line DP-coloring of graphs ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ On \(( 2 , r )\)-choosability of planar graphs without short cycles ⋮ Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable ⋮ On 3-choosability of plane graphs without 6-, 7- and 9-cycles ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Planar graphs without chordal 6-cycles are 4-choosable ⋮ A sufficient condition for DP-4-colorability ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable ⋮ On 3-choosability of planar graphs without certain cycles ⋮ Planar graphs without cycles of specific lengths ⋮ Bordeaux 3-color conjecture and 3-choosability ⋮ Choosability of toroidal graphs without short cycles ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ Planar graphs without 4-cycles adjacent to triangles are 4-choosable ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable ⋮ DP-4-colorability of two classes of planar graphs ⋮ Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable ⋮ On weak flexibility in planar graphs ⋮ On structure of some plane graphs with application to choosability ⋮ DP-coloring on planar graphs without given adjacent short cycles ⋮ Toroidal graphs containing neither nor 6‐cycles are 4‐choosable ⋮ On sufficient conditions for planar graphs to be 5-flexible ⋮ On \((3, r)\)-choosability of some planar graphs ⋮ Group coloring is \(\Pi_2^{\text{P}}\)-complete

Cites Work

This page was built for publication: The 4-choosability of plane graphs without 4-cycles