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.
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- Degree tolerant coloring of graph (Q2061289) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
- A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
- Coloring complexes and combinatorial Hopf monoids (Q2102693) (← links)
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
- Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
- Fashion game on planar graphs (Q2141096) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← links)
- The Alon-Tarsi number of a planar graph minus a matching (Q2200936) (← links)
- Monochromatic subgraphs in iterated triangulations (Q2209888) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← 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)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- Relaxed equitable colorings of planar graphs with girth at least 8 (Q2305904) (← links)
- Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
- Planar Ramsey graphs (Q2327223) (← links)
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
- Vertex coloring edge-weighted digraphs (Q2348711) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Defective 2-colorings of sparse graphs (Q2434717) (← 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)
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (Q2449153) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Every planar graph is 1-defective \((9,2)\)-paintable (Q2656972) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
- Decomposition of planar graphs with forbidden configurations (Q2691577) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← 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)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- A QUESTION ON RELAXED EQUITABLE COLORING (Q3166752) (← links)
- The number of defective colorings of graphs on surfaces (Q3174242) (← links)
- Parameterized (approximate) defective coloring (Q3304104) (← links)
- Improper Colourings of Unit Disk Graphs (Q3439320) (← links)
- Acyclic improper choosability of graphs (Q3439591) (← links)
- Fractional, Circular, and Defective Coloring of Series-Parallel Graphs (Q3466361) (← links)
