Pages that link to "Item:Q730261"
From MaRDI portal
The following pages link to Minimum size of feedback vertex sets of planar graphs of girth at least five (Q730261):
Displaying 12 items.
- Large induced forests in planar graphs with girth 4 (Q1720314) (← links)
- Induced 2-degenerate subgraphs of triangle-free planar graphs (Q1753031) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Maximum induced forests of product graphs (Q2683145) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- Size of the largest induced forest in subcubic graphs of girth at least four and five (Q4646949) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- 3‐Degenerate induced subgraph of a planar graph (Q6056810) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Cycle isolation of graphs with small girth (Q6131294) (← links)
- Splitting plane graphs to outerplanarity (Q6636997) (← links)
