Domination in partitioned graphs with minimum degree two
From MaRDI portal
Publication:870974
DOI10.1016/J.DISC.2006.07.024zbMATH Open1113.05077OpenAlexW1987316428MaRDI QIDQ870974FDOQ870974
Authors: Michael A. Henning, Preben Dahl Vestergaard 
Publication date: 15 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://vbn.aau.dk/ws/files/112711/abstractfil.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with large total domination number
- Domination in graphs with minimum degree two
- Title not available (Why is that?)
- Domination in partitioned graphs
- Bounds related to domination in graphs with minimum degree two
- Title not available (Why is that?)
Cited In (11)
- Dominator partitions of graphs
- Total domination in partitioned graphs
- Title not available (Why is that?)
- Domination number in graphs with minimum degree two
- Almost well-dominated bipartite graphs with minimum degree at least two
- Title not available (Why is that?)
- Distance domination in partitioned graphs
- Total domination in partitioned trees and partitioned graphs with minimum degree two
- Partitioned graphs and domination related parameters
- Domination in partitioned graphs
- Domination in graphs with minimum degree two
This page was built for publication: Domination in partitioned graphs with minimum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870974)
