Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
From MaRDI portal
Publication:4785700
DOI10.1137/S0895480100376253zbMath1006.05024MaRDI QIDQ4785700
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (33)
The 4-choosability of toroidal graphs without intersecting triangles ⋮ On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-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 ⋮ 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 a planar graph to be 4-choosable ⋮ On 3-choosability of planar graphs without certain cycles ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ Bordeaux 3-color conjecture and 3-choosability ⋮ Edge-choosability of planar graphs without non-induced 5-cycles ⋮ Choosability of toroidal graphs without short cycles ⋮ Edge-choosability of planar graphs without adjacent triangles or without 7-cycles ⋮ 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 ⋮ Edge choosability of planar graphs without 5-cycles with a chord ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ Cover and variable degeneracy ⋮ Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable ⋮ DP-coloring on planar graphs without given adjacent short cycles ⋮ List edge coloring of planar graphs without non-induced 6-cycles ⋮ On sufficient conditions for planar graphs to be 5-flexible ⋮ On \((3, r)\)-choosability of some planar graphs
This page was built for publication: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
