Pages that link to "Item:Q3728016"
From MaRDI portal
The following pages link to Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency (Q3728016):
Displaying 50 items.
- Regular independent sets (Q260019) (← links)
- \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles (Q282304) (← links)
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 (Q394211) (← links)
- \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← links)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- A \((3,1)^*\)-choosable theorem on toroidal graphs (Q765376) (← links)
- The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
- The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Planar graphs are 1-relaxed, 4-choosable (Q976159) (← links)
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- Extremal results on defective colorings of graphs (Q1318803) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- Defective 3-paintability of planar graphs (Q1753126) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- A simple competitive graph coloring algorithm. III (Q1880795) (← links)
- On the minimal reducible bound for outerplanar and planar graphs (Q1916137) (← links)
- Weighted improper colouring (Q1932354) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- Some defective parameters in graphs (Q1950405) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- Acyclic improper choosability of subcubic graphs (Q2009524) (← links)
