Pages that link to "Item:Q393935"
From MaRDI portal
The following pages link to On 1-improper 2-coloring of sparse graphs (Q393935):
Displaying 32 items.
- I,F-partitions of sparse graphs (Q298327) (← links)
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- Maximum average degree and relaxed coloring (Q2012543) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- On 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
- Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
- Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
- Defective DP-colorings of sparse simple graphs (Q2237221) (← links)
- Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (Q2800597) (← links)
- (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
- (Q3304104) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
- Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Note on improper coloring of $1$-planar graphs (Q5206449) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Islands in Graphs on Surfaces (Q5743553) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- Path partition of planar graphs with girth at least six (Q6059078) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
- Sparse critical graphs for defective DP-colorings (Q6204323) (← links)
