Extremal perfect graphs for a bound on the domination number
From MaRDI portal
Publication:952634
Recommendations
Cites work
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3341035 (Why is no real title available?)
- A characterization of ptolemaic graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Contributions to the theory of domination, independence and irredundance in graphs
- Distance-hereditary graphs
- Extremal graphs for a new upper bound on domination parameters in graphs
- Graph Classes: A Survey
- Paths, Trees, and Flowers
Cited in
(9)- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- scientific article; zbMATH DE number 5896460 (Why is no real title available?)
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- Further results on complementary perfect domination number of a graph
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Extremal graphs for a new upper bound on domination parameters in graphs
- scientific article; zbMATH DE number 2147928 (Why is no real title available?)
- Extremal hypergraphs for matching number and domination number
- On the integrality of an extreme solution to pluperfect graph and balanced systems
This page was built for publication: Extremal perfect graphs for a bound on the domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952634)