A Note on the Vertex Arboricity of a Graph
From MaRDI portal
Recommendations
Cited in
(38)- Relaxed chromatic numbers of graphs
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs
- A note on the list vertex arboricity of toroidal graphs
- Vertex and tree arboricities of graphs
- Vertex arboricity and maximum degree
- A structural property of trees with an application to vertex-arboricity
- An analogue of DP-coloring for variable degeneracy and its applications
- Two sufficient conditions for a planar graph to be list vertex-2-arborable
- A generalization of some results on list coloring and DP-coloring
- On the vertex arboricity of planar graphs of diameter two
- A flow theory for the dichromatic number
- On the vertex-arboricity of planar graphs
- On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2
- List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
- Vertex arboricity of planar graphs without chordal 6-cycles
- scientific article; zbMATH DE number 5926622 (Why is no real title available?)
- Vertex arboricity and vertex degrees
- On some arboricities in planar graphs
- A note on vertex-arboricity of plane graphs
- scientific article; zbMATH DE number 3959491 (Why is no real title available?)
- Vertex arboricity of toroidal graphs with a forbidden cycle
- Vertex-arboricity of planar graphs without intersecting triangles
- Best monotone degree conditions for graph properties: a survey
- Vertex arboricity of cographs
- On the complexity of digraph colourings and vertex arboricity
- A short proof of Brooks’ Theorem for vertex arboricity
- scientific article; zbMATH DE number 5238175 (Why is no real title available?)
- On inducing degenerate sums through 2-labellings
- Partitioning kite‐free planar graphs into two forests
- A note on the list vertex-arboricity of IC-planar graphs
- Sparsity in covering solutions
- Partitioning a planar graph without chordal 5-cycles into two forests.
- The vertex arboricity of 1-planar graphs
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Commutative rings with unit graphs of small vertex-arboricity
- A sufficient condition for cubic 3-connected plane bipartite graphs to be Hamiltonian
- On Barnette's conjecture
This page was built for publication: A Note on the Vertex Arboricity of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733881)
