Pages that link to "Item:Q317411"

The following pages link to A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411):

Displaying 11 items.

• A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← links)
• Minimum size of feedback vertex sets of planar graphs of girth at least five (Q730261) (← links)
• Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
• A better bound on the largest induced forests in triangle-free planar graph (Q1756090) (← 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)
• The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
• (Q5197598) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• Cycle isolation of graphs with small girth (Q6131294) (← links)