Matching properties in total domination vertex critical graphs

DOI10.1007/S00373-010-0889-XMaRDI QIDQ968225zbMATHOpenAlexFDO

Authors Erfang Shan, Haichao Wang, Liying Kang

Publication date 5 May 2010

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

Full work available at URL https://doi.org/10.1007/s00373-010-0889-x

zbMATH Keywords

matchingfactor-criticaltotal domonation vertex critical graphs

Mathematics Subject Classification ID

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)

Recommendations

• Matching properties in connected domination critical graphs
• Matching properties in domination critical graphs.
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
• Perfect matchings in total domination critical graphs
• Properties of total domination edge-critical graphs
• Perfect matchings in paired domination vertex critical graphs
• Connected domination: vertex criticality and matchings
• On matching and total domination in graphs
• A constructive characterization of total domination vertex critical graphs
• A note on the total domination vertex critical graphs

Cites work

• scientific article; zbMATH DE number 1462928 (Why is no real title available?)
• 3-factor-criticality in domination critical graphs
• A constructive characterization of total domination vertex critical graphs
• A note on the total domination vertex critical graphs
• Domination and total domination on asteroidal triple-free graphs
• Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph”
• Factor-critical property in 3-dominating-critical graphs
• Graph theory with applications
• Matching properties in connected domination critical graphs
• Matching properties in domination critical graphs.
• Matchings in 3-vertex-critical graphs: the odd case
• Matchings in 3‐vertex‐critical graphs: The even case
• On an open problem concerning total domination critical graphs
• On matching and total domination in graphs
• On the total domination number of cross products of graphs
• The diameter of total domination vertex critical graphs
• Total domination in graphs

Cited in

(11)

• Total domination stability in graphs
• 3-factor-criticality in double domination edge critical graphs
• Perfect matchings in paired domination vertex critical graphs
• Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
• Matching properties in connected domination critical graphs
• Matchings in \(4\)-total restrained domination vertex critical graphs.
• Perfect matchings in total domination critical graphs
• Total domination dot-critical graphs
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
• Matchings, path covers and domination
• On matching and semitotal domination in graphs

This page was built for publication: Matching properties in total domination vertex critical graphs

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