Total domination edge critical graphs with total domination number three and many dominating pairs

DOI10.1007/s00373-014-1469-2zbMath1327.05248OpenAlexW1981781158MaRDI QIDQ497305

Camino Balbuena, Teresa W. Haynes, Adriana Hansberg, Michael A. Henning

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1469-2

zbMATH Keywords

dominationdiameter criticaldiameter-2-criticalbull-freetotal domination edge critical

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey ⋮ Certified domination ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ All My Favorite Conjectures Are Critical

Cites Work

• A characterization of diameter-2-critical graphs with no antihole of length four
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
• On a conjecture of Murty and Simon on diameter two critical graphs. II.
• A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
• Ramsey-type theorems
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• The structure of bull-free graphs II and III -- a summary
• The strong perfect graph theorem
• The Erdős-Hajnal conjecture for bull-free graphs
• A survey of selected recent results on total domination in graphs
• Bull-free Berge graphs are perfect
• On diameter 2-critical graphs
• On diameter critical graphs
• Recognizing bull-free perfect graphs
• On a conjecture of Murty and Simon on diameter 2-critical graphs
• A characterization of \(P_5\)-free, diameter-2-critical graphs
• The maximum number of edges in a minimal graph of diameter 2
• Hall's theorem for hypergraphs
• Total Domination in Graphs
• On Critical Graphs of Diameter 2
• Minimum vertex‐diameter‐2‐critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Total domination edge critical graphs with total domination number three and many dominating pairs