scientific article
From MaRDI portal
Publication:3115724
zbMath1249.05110MaRDI QIDQ3115724
Oleg V. Borodin, Anna O. Ivanova
Publication date: 10 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (12)
On 1-improper 2-coloring of sparse graphs ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ \((k,1)\)-coloring of sparse graphs ⋮ \((k,j)\)-coloring of sparse graphs ⋮ Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 ⋮ List strong linear 2-arboricity of sparse graphs ⋮ An introduction to the discharging method via graph coloring ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Near-colorings: non-colorable graphs and NP-completeness ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions ⋮ Partition of a planar graph with girth 6 into two forests with chain length at most 4
This page was built for publication:
