Pages that link to "Item:Q1972133"
From MaRDI portal
The following pages link to Variable degeneracy: Extensions of Brooks' and Gallai's theorems (Q1972133):
Displaying 29 items.
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles (Q294558) (← links)
- A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
- List total arboricity of 2-degenerate graphs (Q714512) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- List point arboricity of dense graphs (Q1043798) (← links)
- A note on the list vertex arboricity of toroidal graphs (Q1800404) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles (Q2074364) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles (Q2107762) (← links)
- Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
- LIST POINT ARBORICITY OF GRAPHS (Q3166733) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Digraphs and Variable Degeneracy (Q5062115) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
- Partitioning into degenerate graphs in linear time (Q6080366) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
