Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs

DOI10.1007/978-3-642-32241-9_12zbMath1365.05133OpenAlexW87884061MaRDI QIDQ2914318

Yngve Villanger, Pinar Heggernes, Jean-François Couturier, Pim van 't Hof

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_12

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (8)

Enumerating minimal connected dominating sets in graphs of bounded chordality ⋮ Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ Minimal dominating sets in interval graphs and trees ⋮ Enumeration and maximum number of minimal connected vertex covers in graphs ⋮ Minimal dominating sets in graph classes: combinatorial bounds and enumeration ⋮ On the maximum number of maximum dissociation sets in trees with given dissociation number ⋮ Enumerating Minimal Tropical Connected Sets ⋮ Subset feedback vertex sets in chordal graphs

This page was built for publication: Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs