The following pages link to (Q4230860):
Displaying 50 items.
- \((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)
- \((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)
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
- A \((3,1)^*\)-choosable theorem on toroidal graphs (Q765376) (← links)
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302) (← 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 are 1-relaxed, 4-choosable (Q976159) (← links)
- A note on list improper coloring of plane graphs (Q1003695) (← links)
- Improper choosability of graphs embedded on the surface of genus \(r\) (Q1402089) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
- Defective 3-paintability of planar graphs (Q1753126) (← 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)
- The Alon-Tarsi number of \(K_5\)-minor-free graphs (Q2075517) (← links)
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles (Q2107762) (← links)
- Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
- Fashion game on planar graphs (Q2141096) (← links)
- The Alon-Tarsi number of a planar graph minus a matching (Q2200936) (← links)
- On 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
- Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
- Defective DP-colorings of sparse simple graphs (Q2237221) (← links)
- Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
- Relaxed equitable colorings of planar graphs with girth at least 8 (Q2305904) (← links)
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) (Q2305911) (← links)
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles (Q2341778) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← links)
- Improper colorability of planar graphs without prescribed short cycles (Q2436833) (← links)
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Every planar graph is 1-defective \((9,2)\)-paintable (Q2656972) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Decomposition of planar graphs with forbidden configurations (Q2691577) (← links)
- Limits of Near-Coloring of Sparse Graphs (Q2874099) (← links)
- (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
- List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
