Restricted total domination in graphs
From MaRDI portal
Publication:1763333
DOI10.1016/J.DISC.2004.09.005zbMATH Open1055.05116OpenAlexW1995285081MaRDI QIDQ1763333FDOQ1763333
Publication date: 22 February 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.09.005
Recommendations
Cites Work
Cited In (12)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- Girth and total domination in graphs
- Title not available (Why is that?)
- Restricted domination in graphs
- Exact and heuristic algorithms for the weighted total domination problem
- Restricted domination parameters in graphs
- A knowledge-based iterated local search for the weighted total domination problem
- Domination and irredundance in graphs with restricted blocks
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Restricted domination in arc-colored digraphs
- Domination versus total domination in claw-free cubic graphs
- Total restrained domination in graphs with minimum degree two
This page was built for publication: Restricted total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763333)