Perfect matchings in total domination critical graphs

DOI10.1007/S00373-010-1000-3zbMATH Open1234.05187OpenAlexW2064587262MaRDI QIDQ659733FDOQ659733

A. 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

Recommendations

• Matching properties in total domination vertex critical graphs
• Matching and factor-critical property in 3-domination-critical graphs
• Matching properties in domination critical graphs.
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
• Connected domination: vertex criticality and matchings

zbMATH Keywords

perfect matchingtotal domination numberedge-critical graphvertex-critical graphfactor-critical graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Matching properties in connected domination critical graphs
• Matching properties in total domination vertex critical graphs
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
• On matching and semitotal domination in graphs
• Total domination stability in graphs
• Perfect matching dominating cycle — a new dominating cycle
• 3-factor-criticality in double domination edge critical graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659733)