Pages that link to "Item:Q1853082"
From MaRDI portal
The following pages link to New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082):
Displaying 13 items.
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Decycling bubble sort graphs (Q494444) (← links)
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies (Q941343) (← links)
- An efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- Feedback vertex sets in star graphs (Q1029080) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Dynamic monopolies and feedback vertex sets in hexagonal grids (Q2429050) (← links)
- The decycling number of $P_{m} \square P_{n}^{\ast}$ (Q2920881) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
