Pages that link to "Item:Q1853123"

The following pages link to Minimum feedback vertex set and acyclic coloring. (Q1853123):

Displaying 18 items.

• A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
• Acyclic coloring with few division vertices (Q396683) (← links)
• Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
• Acyclic colorings of subcubic graphs (Q834929) (← links)
• Large induced forests in planar graphs with girth 4 (Q1720314) (← links)
• \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
• The decycling number of outerplanar graphs (Q1956257) (← links)
• Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth (Q2094884) (← links)
• On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
• Feedback vertex sets in mesh-based networks (Q2383604) (← links)
• Dynamic monopolies and feedback vertex sets in hexagonal grids (Q2429050) (← links)
• Acyclic vertex coloring of graphs of maximum degree six (Q2449135) (← links)
• Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
• Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
• (Q5874489) (← links)
• A polyhedral study of the acyclic coloring problem (Q5891089) (← links)
• A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
• Acyclic 3-coloring of generalized Petersen graphs (Q5963660) (← links)