Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable

DOI10.1002/jgt.20394zbMath1180.05035OpenAlexW4232531262MaRDI QIDQ3652554

Anna O. Ivanova, Oleg V. Borodin

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20394

zbMATH Keywords

induced subgraphsgraph coveringlist coloringpoint arboricity

Mathematics Subject Classification ID

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

Related Items (15)

Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles ⋮ Signed colouring and list colouring of k‐chromatic graphs ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles ⋮ List strong linear 2-arboricity of sparse graphs ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ List vertex-arboricity of planar graphs without intersecting 5-cycles ⋮ List total arboricity of 2-degenerate graphs ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles ⋮ Cover and variable degeneracy ⋮ Vertex arboricity of planar graphs without chordal 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• The existence of unavoidable sets of geographically good configurations
• An extension of Brooks' theorem to n-degenerate graphs
• The 4-choosability of plane graphs without 4-cycles
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• Planar graphs without triangular 4-cycles are 3-choosable
• Critical Point-Arboritic Graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• The Point-Arboricity of Planar Graphs
• The Point Partition Numbers of Closed 2-Manifolds

This page was built for publication: Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable