On the Structure of Graphs Vertex Critical with Respect to Connected Domination

DOI10.1007/978-3-540-76796-1_14zbMath1359.05096OpenAlexW272153672MaRDI QIDQ2971614

Michael D. Plummer

Publication date: 7 April 2017

Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_14

Mathematics Subject Classification ID

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 (2)

Connected domination critical graphs with a block having maximum number of cut vertices ⋮ On the diameter of total domination vertex-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matchings in 3-vertex-critical graphs: the odd case
• Matching theory
• Some inequalities about connected domination number
• Permutation graphs: Connected domination and Steiner trees
• Approximation algorithms for connected dominating sets
• Some results related to the toughness of 3-domination critical graphs
• Matching properties in domination critical graphs.
• Connected domination critical graphs.
• The diameter of total domination vertex critical graphs
• 3-factor-criticality in domination critical graphs
• Matching properties in connected domination critical graphs
• On k-factor-critical graphs
• On Hadwiger's Number and the Stability Number
• The NP-completeness column: an ongoing guide
• Connected Domination and Spanning Trees with Many Leaves
• Some recent results on domination in graphs
• Matchings in 3‐vertex‐critical graphs: The even case

This page was built for publication: On the Structure of Graphs Vertex Critical with Respect to Connected Domination