Pairs of disjoint dominating sets and the minimum degree of graphs
From MaRDI portal
Publication:1959712
DOI10.1007/s00373-010-0918-9zbMath1219.05125OpenAlexW1994959308MaRDI QIDQ1959712
Dieter Rautenbach, Christian Löwenstein
Publication date: 7 October 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00011841
dominationdomination numberdomatic numberdomatic partitioninverse dominationdisjoint domination number
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Graphs with disjoint 2-dominating sets, Minimal graphs with disjoint dominating and paired-dominating sets, Disjoint dominating and total dominating sets in graphs, Pairs of disjoint dominating sets in connected cubic graphs, Domination parameters with number 2: interrelations and algorithmic consequences, Dominating and total dominating partitions in cubic graphs, Disjoint dominating and 2-dominating sets in graphs, Algorithm and complexity of the two disjoint connected dominating sets problem on trees
Cites Work
- Remarks about disjoint dominating sets
- On minimum dominating sets with minimum intersection
- Inverse domination in graphs
- On minimum intersection of two minimum dominating sets of interval graphs
- Domination in graphs with minimum degree two
- Towards a theory of domination in graphs
- A Winning Strategy for the Ramsey Graph Game
- Approximating theDomatic Number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item