Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
From MaRDI portal
Publication:2914318
Recommendations
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- scientific article; zbMATH DE number 1342121
- Subset feedback vertex sets in chordal graphs
- A Min-Max Theorem on Feedback Vertex Sets
- Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
- Enumerating minimal subset feedback vertex sets
- Enumerating minimal subset feedback vertex sets
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- On locating minimum feedback vertex sets
Cited in
(10)- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Maximal and maximum dissociation sets in general and triangle-free graphs
- Enumerating Minimal Tropical Connected Sets
- Minimal dominating sets in interval graphs and trees
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- On the maximum number of maximum dissociation sets in trees with given dissociation number
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Subset feedback vertex sets in chordal graphs
- The size of graphs with given feedback vertex number
This page was built for publication: Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914318)