Extremal perfect graphs for a bound on the domination number
DOI10.1016/J.DISC.2007.04.027zbMATH Open1158.05043OpenAlexW2074882100MaRDI QIDQ952634FDOQ952634
Frédéric Maffray, Mostafa Blidia, Mustapha Chellali
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.027
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- Paths, Trees, and Flowers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Distance-hereditary graphs
- A characterization of ptolemaic graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- Extremal graphs for a new upper bound on domination parameters in graphs
Cited In (7)
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Further results on complementary perfect domination number of a graph
- Title not available (Why is that?)
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Extremal hypergraphs for matching number and domination number
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- 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)
