Distance paired-domination problems on subclasses of chordal graphs

DOI10.1016/j.tcs.2009.08.005zbMath1191.68463DBLPjournals/tcs/ChenLZ09aOpenAlexW1997424711WikidataQ60630617 ScholiaQ60630617MaRDI QIDQ1034627

Lei Chen, Zhenbing Zeng, Chang-hong Lu

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.005

zbMATH Keywords

algorithmtreesinterval graphblock graphspaired-domination\(k\)-distance domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Complexity of distance paired-domination problem in graphs ⋮ Algorithmic aspects of upper paired-domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination in inflated graphs
• Graphs with large paired-domination number
• Labelling algorithms for paired-domination problems in block and interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Paired-domination of trees
• Partitioning chordal graphs into independent sets and cliques
• Paired domination on interval and circular-arc graphs
• Distance paired domination numbers of graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination in graphs

This page was built for publication: Distance paired-domination problems on subclasses of chordal graphs