The point-arboricity of a graph
From MaRDI portal
Publication:2529589
DOI10.1007/BF02760181zbMath0164.54201OpenAlexW1965633932MaRDI QIDQ2529589
Gary Chartrand, H. V. Kronk, Curtiss E. Wall
Publication date: 1968
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02760181
Related Items
Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Hamiltonicity and generalised total colourings of planar graphs ⋮ Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ LIST POINT ARBORICITY OF GRAPHS ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ Vertex arboricity and maximum degree ⋮ On the vertex arboricity of planar graphs of diameter two ⋮ The complexity of \(G\)-free colourability ⋮ $B$-sets and coloring problems ⋮ Induced-path partition on graphs with special blocks ⋮ Equitable list vertex colourability and arboricity of grids ⋮ The \(k\)-strong induced arboricity of a graph ⋮ Parallel complexity of partitioning a planar graph into vertex-induced forests ⋮ List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles ⋮ Complete acyclic colorings ⋮ Vertex arboricity of toroidal graphs with a forbidden cycle ⋮ 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 ⋮ Achromatic arboricity on complete graphs ⋮ On inducing degenerate sums through 2-labellings ⋮ On the vertex-arboricity of planar graphs ⋮ Partitioning of a graph into induced subgraphs not containing prescribed cliques ⋮ Partitioning kite‐free planar graphs into two forests ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ Single-pass streaming algorithms to partition graphs into few forests ⋮ 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 ⋮ Planar Digraphs of Digirth Five Are 2-Colorable ⋮ Efficient algorithms for acyclic colorings of graphs ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ A short proof of Brooks’ Theorem for vertex arboricity ⋮ List vertex-arboricity of planar graphs without intersecting 5-cycles ⋮ Acyclic sum-list-colouring of cylinders ⋮ A structural property of trees with an application to vertex-arboricity ⋮ On generalized perfect graphs: Bounded degree and bounded edge perfection ⋮ Rings whose total graphs have small vertex-arboricity and arboricity ⋮ Tree coloring of distance graphs with a real interval set ⋮ On the critical point-arboricity graphs ⋮ Acyclic colorings of planar graphs ⋮ Partition the vertices of a graph into one independent set and one acyclic set ⋮ List total arboricity of 2-degenerate graphs ⋮ Circular vertex arboricity ⋮ Unnamed Item ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ Randić index and coloring number of a graph ⋮ On the minors of an incidence matrix and Smith normal form ⋮ Conditional chromatic numbers with forbidden cycles ⋮ Chromatic partitions of a graph ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Uniquely k-arborable graphs ⋮ The subchromatic number of a graph ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles ⋮ Cover and variable degeneracy ⋮ Unnamed Item ⋮ A sequential coloring algorithm for finite sets ⋮ Induced forests in cubic graphs ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic ⋮ Computers and discovery in algebraic graph theory ⋮ Vertex arboricity of planar graphs without chordal 6-cycles
Cites Work
