Choosability and edge choosability of planar graphs without five cycles
From MaRDI portal
Publication:1609512
DOI10.1016/S0893-9659(02)80007-6zbMath0994.05060MaRDI QIDQ1609512
Publication date: 15 August 2002
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (63)
Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ LIST POINT ARBORICITY OF GRAPHS ⋮ Unnamed Item ⋮ On group choosability of total graphs ⋮ Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate ⋮ On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ Find subtrees of specified weight and cycles of specified length in linear time ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles ⋮ Choosability in signed planar graphs ⋮ Separating signatures in signed planar graphs ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ Variable degeneracy on toroidal graphs ⋮ Weak degeneracy of planar graphs without 4- and 6-cycles ⋮ On the vertex-arboricity of planar graphs ⋮ On-line DP-coloring of graphs ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Acyclic edge coloring of planar graphs without 5-cycles ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ A note on edge-group choosability of planar graphs without 5-cycles ⋮ Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ An introduction to the discharging method via graph coloring ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Equitable list colorings of planar graphs without short cycles ⋮ Planar graphs without chordal 6-cycles are 4-choosable ⋮ A sufficient condition for DP-4-colorability ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS ⋮ On 3-choosability of planar graphs without certain cycles ⋮ Planar graphs without cycles of specific lengths ⋮ On the equitable vertex arboricity of graphs ⋮ 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 ⋮ Some sufficient conditions for a planar graph of maximum degree six to be Class 1 ⋮ Choosability of toroidal graphs without short cycles ⋮ Structural properties and edge choosability of planar graphs without 4-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 specific cycles are 2-degenerate ⋮ Planar graphs without 4-cycles adjacent to triangles are 4-choosable ⋮ Cycle spectra of contraction-critically 4-connected planar graphs ⋮ Edge choosability of planar graphs without 5-cycles with a chord ⋮ Edge choosability of planar graphs without small cycles ⋮ 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 ⋮ Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic ⋮ DP-coloring on planar graphs without given adjacent short cycles ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles ⋮ Vertex arboricity of planar graphs without chordal 6-cycles ⋮ Distribution of subtree sums ⋮ List edge coloring of planar graphs without non-induced 6-cycles ⋮ Toroidal graphs containing neither nor 6‐cycles are 4‐choosable
Cites Work
This page was built for publication: Choosability and edge choosability of planar graphs without five cycles
