The Point-Arboricity of Planar Graphs

Cited in

(80)

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

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)