Perfect matchings in total domination critical graphs

DOI10.1007/s00373-010-1000-3zbMath1234.05187OpenAlexW2064587262MaRDI QIDQ659733

Anders Yeo, Michael A. Henning

Publication date: 24 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00373-010-1000-3

zbMATH Keywords

perfect matchingfactor-critical graphstotal domination numberedge-critical graphvertex-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

3-factor-criticality in double domination edge critical graphs ⋮ Total domination stability in graphs ⋮ On matching and semitotal domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs
• Total domination of graphs and small transversals of hypergraphs
• Properties of total domination edge-critical graphs
• Matching properties in total domination vertex critical graphs
• A survey of selected recent results on total domination in graphs
• A constructive characterization of total domination vertex critical graphs
• On total domination vertex critical graphs of high connectivity
• Matching theory
• On diameter 2-critical graphs
• On diameter critical graphs
• The diameter of total domination vertex critical graphs
• On a conjecture of Murty and Simon on diameter 2-critical graphs
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• Total domination in graphs
• The maximum number of edges in a minimal graph of diameter 2
• Total Domination Edge Critical Graphs with Maximum Diameter
• On Critical Graphs of Diameter 2
• A Short Proof of the Factor Theorem for Finite Graphs
• Domination critical graphs

This page was built for publication: Perfect matchings in total domination critical graphs