List strong linear 2-arboricity of sparse graphs
From MaRDI portal
Publication:3005110
DOI10.1002/jgt.20516zbMath1218.05038MaRDI QIDQ3005110
Anna O. Ivanova, Oleg V. Borodin
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
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C07: Vertex degrees
Related Items
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, Unnamed Item, Path partition of planar graphs with girth at least six, On 1-improper 2-coloring of sparse graphs, Acyclic 3-choosability of sparse graphs with girth at least 7, 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, Vertex Partitions of Graphs into Cographs and Stars
Cites Work
- Unnamed Item
- Unnamed Item
- \((k,1)\)-coloring of sparse graphs
- Acyclic 3-choosability of sparse graphs with girth at least 7
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems
- List improper colorings of planar graphs with prescribed girth
- On the vertex-arboricity of planar graphs
- Path partitions of planar graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- On the linear vertex-arboricity of a planar graph
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- Improper choosability of graphs and maximum average degree
- The Point-Arboricity of Planar Graphs