Domination problems on P5-free graphs
From MaRDI portal
Publication:5248877
DOI10.1051/ita/2014026zbMath1408.05102OpenAlexW2068407006MaRDI QIDQ5248877
Michel J. Mizrahi, Min Chih Lin
Publication date: 28 April 2015
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2014026
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Dominating sets for split and bipartite graphs
- Efficient algorithms for Roman domination on some classes of graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Roman domination in graphs.
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Domination and total domination on asteroidal triple-free graphs
- Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs
- Arboricity and Subgraph Listing Algorithms
- Domination in permutation graphs
- Dominating Sets in Chordal Graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Domination in Graphs Applied to Electric Power Networks
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs
This page was built for publication: Domination problems on P5-free graphs
