The Point-Arboricity of Planar Graphs

Cited In (81)

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

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)