Total domination in interval graphs revisited

DOI10.1016/0020-0190(88)90076-2zbMath0662.68069OpenAlexW2015453827MaRDI QIDQ1114413

G. Ramalingam, C. Pandu Rangan

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90076-2

zbMATH Keywords

algorithminterval graphtotal domination

Mathematics Subject Classification ID

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

Related Items (7)

Paired domination on interval and circular-arc graphs ⋮ Weighted independent perfect domination on cocomparability graphs ⋮ Algorithmic Aspects of Disjunctive Total Domination in Graphs ⋮ The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ A survey of selected recent results on total domination in graphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Dominating Sets in Chordal Graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• The NP-completeness column: An ongoing guide
• Total domination in interval graphs
• Total domination in interval graphs

This page was built for publication: Total domination in interval graphs revisited