Hereditary dominating pair graphs
From MaRDI portal
Publication:1421473
DOI10.1016/S0166-218X(03)00304-4zbMath1032.05116OpenAlexW1981399828WikidataQ63258018 ScholiaQ63258018MaRDI QIDQ1421473
Nataša Pržulj, Ekkehard Köhler, Derek Gordon Corneil
Publication date: 26 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00304-4
Related Items (2)
Convex and isometric domination of (weak) dominating pair graphs ⋮ Linear separation of connected dominating sets in graphs
Cites Work
- Tolerance graphs
- Representation of a finite graph by a set of intervals on the real line
- Algorithmic Aspects of Vertex Elimination on Graphs
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Asteroidal Triple-Free Graphs
- Dominating Pair Graphs
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Unnamed Item
This page was built for publication: Hereditary dominating pair graphs