Pages that link to "Item:Q2914318"
From MaRDI portal
The following pages link to Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (Q2914318):
Displaying 10 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies (Q941343) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)