Critical Point-Arboritic Graphs

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

John Mitchem, H. V. Kronk

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

05C05: Trees

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles, 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, List total arboricity of 2-degenerate graphs, 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, Circular vertex arboricity, 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, Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable, Unnamed Item