The Point-Arboricity of Planar Graphs

DOI10.1112/jlms/s1-44.1.612zbMath0175.50505OpenAlexW1989544707MaRDI QIDQ5565641

H. V. Kronk, Gary Chartrand

Publication date: 1969

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

Full work available at URL: https://doi.org/10.1112/jlms/s1-44.1.612

zbMATH Keywords

topology

Related Items

Equitable vertex arboricity of subcubic graphs ⋮ Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ Path choosability of planar graphs ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ On the vertex arboricity of planar graphs of diameter two ⋮ $B$-sets and coloring problems ⋮ On a class of Hamiltonian polytopes ⋮ On point-linear arboricity of planar graphs ⋮ A flow theory for the dichromatic number ⋮ On Equitable List Arboricity of Graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Parallel complexity of partitioning a planar graph into vertex-induced forests ⋮ Equitable vertex arboricity of 5-degenerate graphs ⋮ Equitable vertex arboricity of graphs ⋮ Complete acyclic colorings ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Vertex arboricity of toroidal graphs with a forbidden cycle ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles ⋮ A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles ⋮ Vertex-arboricity of planar graphs without intersecting triangles ⋮ NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ On the vertex-arboricity of planar graphs ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Partitioning kite‐free planar graphs into two forests ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs ⋮ Not all planar graphs are in PURE-4-DIR ⋮ 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 ⋮ Partitioning a triangle-free planar graph into a forest and a forest of bounded degree ⋮ Critically partitionable graphs. II ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Efficient algorithms for acyclic colorings of graphs ⋮ List strong linear 2-arboricity of sparse graphs ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ List vertex-arboricity of planar graphs without intersecting 5-cycles ⋮ The extremal function for Petersen minors ⋮ Equitable vertex arboricity of planar graphs ⋮ A structural property of trees with an application to vertex-arboricity ⋮ Acyclic colorings of planar graphs ⋮ An intermediate value theorem for the arboricities ⋮ On the critical point-arboricity graphs ⋮ Acyclic colorings of planar graphs ⋮ List total arboricity of 2-degenerate graphs ⋮ On acyclic colorings of planar graphs. (Reprint) ⋮ Equitable partition of planar graphs ⋮ Some results in topological graph theory ⋮ On partitions of graphs into trees ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Tree-coloring problems of bounded treewidth graphs ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ On acyclic colorings of planar graphs ⋮ Randić index and coloring number of a graph ⋮ Conditional chromatic numbers with forbidden cycles ⋮ Chromatic partitions of a graph ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ The star dichromatic number ⋮ Uniquely k-arborable graphs ⋮ The subchromatic number of a graph ⋮ 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 ⋮ Unnamed Item ⋮ List point arboricity of dense graphs ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic ⋮ An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 ⋮ Vertex arboricity of planar graphs without chordal 6-cycles