Edge criticality in graph domination

DOI10.1007/S00373-015-1607-5zbMath1339.05299OpenAlexW963090145MaRDI QIDQ295267

Jan H. van Vuuren

Publication date: 13 June 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-015-1607-5

zbMATH Keywords

criticalityedge removalgraph domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

The cost of edge removal in graph domination

Cites Work

• On the complexity of the bondage and reinforcement problems
• Domination alteration sets in graphs
• The bondage number of a graph
• New results about the bondage number of a graph
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge criticality in graph domination