Extremal perfect graphs for a bound on the domination number

DOI10.1016/J.DISC.2007.04.027zbMath1158.05043OpenAlexW2074882100MaRDI QIDQ952634

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

zbMATH Keywords

extremal graphsbipartite graphschordal graphsdomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-hereditary graphs
• Contributions to the theory of domination, independence and irredundance in graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Extremal graphs for a new upper bound on domination parameters in graphs
• A characterization of ptolemaic graphs
• Graph Classes: A Survey
• Paths, Trees, and Flowers

This page was built for publication: Extremal perfect graphs for a bound on the domination number