Matching properties in total domination vertex critical graphs
DOI10.1007/S00373-010-0889-XzbMATH Open1205.05172OpenAlexW2086842019MaRDI QIDQ968225FDOQ968225
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
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
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
- Graph theory with applications
- Total domination in graphs
- Domination and total domination on asteroidal triple-free graphs
- On matching and total domination in graphs
- On an open problem concerning total domination critical graphs
- On the total domination number of cross products of graphs
- A constructive characterization of total domination vertex critical graphs
- The diameter of total domination vertex critical graphs
- Matching properties in domination critical graphs.
- 3-factor-criticality in domination critical graphs
- Matchings in 3‐vertex‐critical graphs: The even case
- Title not available (Why is that?)
- A note on the total domination vertex critical graphs
- Matchings in 3-vertex-critical graphs: the odd case
- Factor-critical property in 3-dominating-critical graphs
- Matching properties in connected domination critical graphs
- Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph”
Cited In (11)
- Total domination dot-critical graphs
- Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
- Perfect matchings in paired domination vertex critical graphs
- Matching properties in connected domination critical graphs
- Matchings, path covers and domination
- Matchings in \(4\)-total restrained 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 matchings in total domination critical graphs
- 3-factor-criticality in double domination edge critical 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)
