List strong linear 2-arboricity of sparse graphs

DOI10.1002/JGT.20516MaRDI QIDQ3005110zbMATH OpenOpenAlexFDO

Authors Oleg V. Borodin, Anna O. Ivanova

Publication date 7 June 2011

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

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

zbMATH Keywords

list coloringplanar graphstar forestvertex arboricityvertex partitions

Mathematics Subject Classification ID

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

Recommendations

• \((k,1)\)-coloring of sparse graphs
• Near-proper vertex 2-colorings of sparse graphs
• \((k,j)\)-coloring of sparse graphs
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
• Defective 2-colorings of sparse graphs

Cites work

• \((k,1)\)-coloring of sparse graphs
• Acyclic 3-choosability of sparse graphs with girth at least 7
• An oriented 7-colouring of planar graphs with girth at least 7
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• Improper choosability of graphs and maximum average degree
• List improper colorings of planar graphs with prescribed girth
• List Improper Colourings of Planar Graphs
• Near-proper vertex 2-colorings of sparse graphs
• On the linear vertex-arboricity of a planar graph
• On the vertex-arboricity of planar graphs
• Path partitions of planar graphs
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• The Point-Arboricity of Planar Graphs
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k

Cited in

(15)

• Path choosability of planar graphs
• Splitting a planar graph of girth 5 into two forests with trees of small diameter
• Colouring planar graphs with bounded monochromatic components
• Partitioning sparse graphs into an independent set and a graph with bounded size components
• Defective 2-colorings of sparse graphs
• Vertex partitions of graphs into cographs and stars
• Near-proper vertex 2-colorings of sparse graphs
• On 1-improper 2-coloring of sparse graphs
• \((k,j)\)-coloring of sparse graphs
• Splitting planar graphs of girth 6 into two linear forests with short paths
• Defective and clustered choosability of sparse graphs
• Partition of a planar graph with girth 6 into two forests with chain length at most 4
• Partitioning planar graphs with girth at least 6 into bounded size components
• Path partition of planar graphs with girth at least six
• Acyclic 3-choosability of sparse graphs with girth at least 7

This page was built for publication: List strong linear 2-arboricity of sparse graphs

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