Cited in
(82)- List point arboricity of dense graphs
- On a class of Hamiltonian polytopes
- On point-linear arboricity of planar graphs
- Critically partitionable graphs. II
- Some results in topological graph theory
- On partitions of graphs into trees
- On acyclic colorings of planar graphs
- Chromatic partitions of a graph
- Path choosability of planar graphs
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
- Vertex arboricity of planar graphs without intersecting 5-cycles
- The extremal function for Petersen minors
- Generalizations of independence and chromatic numbers of a graph
- Conditional chromatic numbers with forbidden cycles
- The subchromatic number of a graph
- Surfaces, tree-width, clique-minors, and partitions
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- Efficient algorithms for acyclic colorings of graphs
- List vertex-arboricity of planar graphs without intersecting 5-cycles
- A structural property of trees with an application to vertex-arboricity
- Equitable partition of planar graphs
- An analogue of DP-coloring for variable degeneracy and its applications
- The star dichromatic number
- Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles
- Cover and variable degeneracy
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- Two sufficient conditions for a planar graph to be list vertex-2-arborable
- Complete acyclic colorings
- A generalization of some results on list coloring and DP-coloring
- A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy
- Tree-coloring problems of bounded treewidth graphs
- On the vertex arboricity of planar graphs of diameter two
- A flow theory for the dichromatic number
- 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
- On acyclic colorings of planar graphs. (Reprint)
- Chromatic sums for colorings avoiding monochromatic subgraphs
- Uniquely k-arborable graphs
- Equitable vertex arboricity of subcubic graphs
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
- On the critical point-arboricity graphs
- Vertex arboricity of planar graphs without chordal 6-cycles
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
- Drawing Graphs on Few Lines and Few Planes
- List strong linear 2-arboricity of sparse graphs
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- scientific article; zbMATH DE number 3724489 (Why is no real title available?)
- Equitable vertex arboricity of graphs
- Vertex arboricity of toroidal graphs with a forbidden cycle
- scientific article; zbMATH DE number 3455289 (Why is no real title available?)
- Vertex-arboricity of planar graphs without intersecting triangles
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
- On the vertex-arboricity of planar graphs without 7-cycles
- Best monotone degree conditions for graph properties: a survey
- A weaker version of a conjecture on list vertex arboricity of graphs
- On equitable list arboricity of graphs
- Not all planar graphs are in PURE-4-DIR
- Equitable vertex arboricity of planar graphs
- An intermediate value theorem for the arboricities
- B-sets and coloring problems
- Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic
- Acyclic colorings of planar graphs
- Acyclic colorings of planar graphs
- Extremal decompositions for Nordhaus-Gaddum theorems
- 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
- 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
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- Partitioning kite‐free planar graphs into two forests
- NC algorithms for partitioning sparse graphs into induced forests with an application
- Interpolation theorems for the arboricity and the vertex arboricity of graphs
- Partitioning planar graph of girth 5 into two forests with maximum degree 4.
- Partitioning a planar graph without chordal 5-cycles into two forests.
- Product structure of graphs with an excluded minor
- Commutative rings with unit graphs of small vertex-arboricity
- Treewidth 2 in the planar graph product structure theorem
- List total arboricity of 2-degenerate graphs
- Randić index and coloring number of a graph
- Some recent progress and applications in graph minor theory
This page was built for publication: The Point-Arboricity of Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565641)
