Related references
Note: Only part of the references are listed.Partitioning sparse graphs into an independent set and a graph with bounded size components
Ilkyoo Choi et al.
DISCRETE MATHEMATICS (2020)
SPARSE GRAPHS ARE NEAR-BIPARTITE
Daniel W. Cranston et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2020)
Defective 2-colorings of sparse graphs
O. V. Borodin et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2014)
On 1-improper 2-coloring of sparse graphs
O. V. Borodin et al.
DISCRETE MATHEMATICS (2013)
A Complexity Dichotomy for the Coloring of Sparse Graphs
Louis Esperet et al.
JOURNAL OF GRAPH THEORY (2013)
Vertex Decompositions of Sparse Graphs into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most k
O. V. Borodin et al.
JOURNAL OF GRAPH THEORY (2010)
Share Paper
