Critical Point-Arboritic Graphs

Cited in

(42)

Vertex arboricity of integer distance graph \(G(D_{m,k})\)
Critically partitionable graphs. I
Erdős-Hajnal well-orderings and n-degenerate graphs
On graphs critical with respect to vertex partition numbers
Critically partitionable graphs. II
An extension of Brooks' theorem to n-degenerate graphs
Some results in topological graph theory
The total chromatic number of any multigraph with maximum degree five is at most seven
A note on the list vertex arboricity of toroidal graphs
Vertex arboricity and maximum degree
Partitioning a graph into degenerate subgraphs
Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles
Cover and variable degeneracy
Point partition numbers: decomposable and indecomposable critical graphs
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
Circular vertex arboricity
Tree-coloring problems of bounded treewidth graphs
On the vertex arboricity of planar graphs of diameter two
Equitable vertex arboricity of 5-degenerate graphs
On the vertex-arboricity of planar graphs
On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2
Tree coloring of distance graphs with a real interval set
On the critical point-arboricity graphs
Vertex arboricity of planar graphs without chordal 6-cycles
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
scientific article; zbMATH DE number 3724489 (Why is no real title available?)
Vertex arboricity of toroidal graphs with a forbidden cycle
On the vertex-arboricity of planar graphs without 7-cycles
Spanning cycles in regular matroids without small cocircuits
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
Digraphs and variable degeneracy
A short proof of Brooks’ Theorem for vertex arboricity
Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
Extremal decompositions for Nordhaus-Gaddum theorems
Partitions of hypergraphs under variable degeneracy constraints
Generalized DP-colorings of graphs
Supereulerian regular matroids without small cocircuits
On inducing degenerate sums through 2-labellings
A sufficient condition for cubic 3-connected plane bipartite graphs to be Hamiltonian
Supereulerian of regular matroids with cogirth conditions
List total arboricity of 2-degenerate graphs

This page was built for publication: Critical Point-Arboritic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052165)