Critical Point-Arboritic Graphs

DOI10.1112/jlms/s2-9.3.459zbMath0298.05132OpenAlexW1980735609MaRDI QIDQ4052165

H. V. Kronk, John Mitchem

Publication date: 1975

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-9.3.459

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (40)

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

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