Matching properties in total domination vertex critical graphs
From MaRDI portal
Publication:968225
DOI10.1007/s00373-010-0889-xzbMath1205.05172OpenAlexW2086842019MaRDI QIDQ968225
Erfang Shan, Hai-Chao Wang, Li-ying 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
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 (7)
3-factor-criticality in double domination edge critical graphs ⋮ Matchings, path covers and domination ⋮ Total domination dot-critical graphs ⋮ Total domination stability in graphs ⋮ Perfect matchings in paired domination vertex critical graphs ⋮ On matching and semitotal domination in graphs ⋮ Perfect matchings in total domination critical graphs
Cites Work
- Matchings in 3-vertex-critical graphs: the odd case
- On the total domination number of cross products of graphs
- On an open problem concerning total domination critical graphs
- A constructive characterization of total domination vertex critical graphs
- Factor-critical property in 3-dominating-critical graphs
- Matching properties in domination critical graphs.
- The diameter of total domination vertex critical graphs
- Domination and total domination on asteroidal triple-free graphs
- 3-factor-criticality in domination critical graphs
- Matching properties in connected domination critical graphs
- On matching and total domination in graphs
- Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph”
- Total domination in graphs
- Matchings in 3‐vertex‐critical graphs: The even case
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Matching properties in total domination vertex critical graphs
