Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

DOI10.1137/S0895480100376253MaRDI QIDQ4785700zbMATH OpenFDO

Authors Ko-Wei Lih, Weifan Wang

Publication date 5 January 2003

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480100376253

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge choosability of planar graphs without small cycles
• A note on edge-choosability of planar graphs without intersecting 4-cycles
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
• Planar graphs without intersecting 5-cycles are 4-choosable
• The 4-choosability of toroidal graphs without intersecting triangles

Cited in

(38)

• Edge choosability of planar graphs without 5-cycles with a chord
• On 3-choosable planar graphs of girth at least 4
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• Planar graphs without chordal 6-cycles are 4-choosable
• Choosability, edge choosability and total choosability of outerplane graphs
• The edge-face choosability of plane graphs
• DP-4-coloring of planar graphs with some restrictions on cycles
• The 4-choosability of planar graphs and cycle adjacency
• 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
• On \((3, r)\)-choosability of some planar graphs
• Planar graphs without 7-cycles and butterflies are DP-4-colorable
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• List coloring and diagonal coloring for plane graphs of diameter two
• DP-4-colorability of planar graphs without adjacent cycles of given length
• List edge coloring of planar graphs without non-induced 6-cycles
• Planar graphs without intersecting 5-cycles are 4-choosable
• Bordeaux 3-color conjecture and 3-choosability
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• Choosability of toroidal graphs without short cycles
• Edge choosablity and total choosability of toroidal graphs without intersecting triangles.
• DP-coloring on planar graphs without given adjacent short cycles
• Planar graphs without chordal 6-cycles and necklaces are DP-4-colorable
• A sufficient condition for a planar graph to be 4-choosable
• A note on edge-choosability of planar graphs without intersecting 4-cycles
• A sufficient condition for planar graphs to be DP-4-colorable
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• Variable degeneracy of planar graphs without chorded 6-cycles
• Choosability with union separation of planar graphs without intersecting triangles
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• 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
• On 3-choosability of planar graphs without certain cycles
• Edge-choosability of planar graphs without non-induced 5-cycles
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles

This page was built for publication: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

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