Perfect graphs involving semitotal and semipaired domination
From MaRDI portal
Publication:721925
DOI10.1007/s10878-018-0303-9zbMath1392.05088OpenAlexW2802627953MaRDI QIDQ721925
Michael A. Henning, Teresa W. Haynes
Publication date: 20 July 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0303-9
Related Items
Semipaired Domination in Some Subclasses of Chordal Graphs, Trees with unique minimum semitotal dominating sets, Semipaired domination in claw-free cubic graphs, Semitotal domination number of some graph operations, A linear-time algorithm for semitotal domination in strongly chordal graphs, Domination versus semipaired domination in trees, Bounds on the semipaired domination number of graphs with minimum degree at least two, Complexity and algorithms for semipaired domination in graphs, Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width, The semitotal domination problem in block graphs, Semipaired domination in maximal outerplanar graphs, Unique minimum semipaired dominating sets in trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- Vertices contained in all or in no minimum semitotal dominating set of a tree
- Edge weighting functions on semitotal dominating sets
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- On matching and semitotal domination in graphs
- A characterization of perfect graphs
- Paired-domination in graphs
- An induced subgraph characterization of domination perfect graphs
- Berge trigraphs
- Semitotal domination in claw-free cubic graphs
- On the strong perfect graph conjecture
