The following pages link to Critical Point-Arboritic Graphs (Q4052165):
Displayed 40 items.
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles (Q294558) (← links)
- Vertex arboricity of toroidal graphs with a forbidden cycle (Q400411) (← links)
- On the vertex-arboricity of planar graphs without 7-cycles (Q442319) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- List total arboricity of 2-degenerate graphs (Q714512) (← links)
- Vertex arboricity of integer distance graph \(G(D_{m,k})\) (Q1024482) (← links)
- Critically partitionable graphs. I (Q1136783) (← links)
- Erdős-Hajnal well-orderings and n-degenerate graphs (Q1143403) (← links)
- On graphs critical with respect to vertex partition numbers (Q1157342) (← links)
- Critically partitionable graphs. II (Q1168331) (← links)
- An extension of Brooks' theorem to n-degenerate graphs (Q1235185) (← links)
- Some results in topological graph theory (Q1241523) (← links)
- The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668) (← links)
- A note on the list vertex arboricity of toroidal graphs (Q1800404) (← links)
- Vertex arboricity and maximum degree (Q1894756) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles (Q2074364) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- Circular vertex arboricity (Q2275930) (← links)
- Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
- On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
- Equitable vertex arboricity of 5-degenerate graphs (Q2410094) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 (Q2436824) (← links)
- Tree coloring of distance graphs with a real interval set (Q2481438) (← links)
- On the critical point-arboricity graphs (Q2778282) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)
- (Q3912614) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Digraphs and Variable Degeneracy (Q5062115) (← links)
- A short proof of Brooks’ Theorem for vertex arboricity (Q5154607) (← links)
- (Q5197598) (← links)
- Extremal decompositions for Nordhaus-Gaddum theorems (Q6046167) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- Supereulerian regular matroids without small cocircuits (Q6093141) (← links)
- On inducing degenerate sums through 2-labellings (Q6154381) (← links)