Perfect graphs involving semitotal and semipaired domination
From MaRDI portal
Publication:721925
DOI10.1007/S10878-018-0303-9zbMATH Open1392.05088OpenAlexW2802627953WikidataQ129837346 ScholiaQ129837346MaRDI QIDQ721925FDOQ721925
Authors: Teresa W. Haynes, Michael A. Henning 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of perfect graphs
- Berge trigraphs
- The strong perfect graph theorem
- Paired-domination in graphs
- Semitotal domination in claw-free cubic graphs
- An induced subgraph characterization of domination perfect graphs
- Semitotal domination in graphs
- Paired domination in graphs: a survey and recent results
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- On the strong perfect graph conjecture
- Edge weighting functions on semitotal dominating sets
- On matching and semitotal domination in graphs
- Semipaired domination in graphs
- Vertices contained in all or in no minimum semitotal dominating set of a tree
Cited In (16)
- Title not available (Why is that?)
- Unique minimum semipaired dominating sets in trees
- Bounds on the semipaired domination number of graphs with minimum degree at least two
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Title not available (Why is that?)
- Trees with unique minimum semitotal dominating sets
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Semipaired domination in maximal outerplanar graphs
- Semitotal domination number of some graph operations
- Semipaired domination in graphs
- Title not available (Why is that?)
- Semipaired Domination in Some Subclasses of Chordal Graphs
- The semitotal domination problem in block graphs
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Domination versus semipaired domination in trees
- Semipaired domination in claw-free cubic graphs
This page was built for publication: Perfect graphs involving semitotal and semipaired domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721925)
