scientific article; zbMATH DE number 3565019

Cited in

(37)

Large induced forests in planar graphs with girth 4
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
Equitable partition of planar graphs
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
On the vertex partition of planar graphs into forests with bounded degree
On acyclically 4-colorable maximal planar graphs
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
Large induced forests in triangle-free planar graphs
Acyclically 4-colorable triangulations
Partial DP-coloring of graphs
A 13k-kernel for planar feedback vertex set via region decomposition
A lower bound on the order of the largest induced forest in planar graphs with high girth
A Conjecture of Borodin and a Coloring of Grünbaum
Maximum induced forests in graphs of bounded treewidth
Maximum 4-degenerate subgraph of a planar graph
Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
Construction of acyclically 4-colourable planar triangulations with minimum degree 4
Robust connectivity of graphs on surfaces
Coloring parameters for graphs on surfaces
Graph theory (algorithmic, algebraic, and metric problems)
Acyclic 5-choosability of planar graphs without 4-cycles
An (F1,F4)‐partition of graphs with low genus and girth at least 6
3‐Degenerate induced subgraph of a planar graph
The k‐path vertex cover: General bounds and chordal graphs
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
Degenerate and star colorings of graphs on surfaces
The decycling number of a line graph
An \((\mathcal{F}_3, \mathcal{F}_4)\)-partition of planar graphs without 4- and 6-cycles
The decycling number of a graph with large girth embedded in a surface
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
Acyclic 4-choosability of planar graphs without adjacent short cycles
Minimum size of feedback vertex sets of planar graphs of girth at least five
Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4137202)