Strong elimination ordering of the total graph of a tree

DOI10.1016/0166-218X(92)90181-9zbMath0769.05029OpenAlexW2004824881MaRDI QIDQ1201815

R. Bačik, Janez Aleš

Publication date: 17 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90181-9

zbMATH Keywords

strongly chordal graphslinear algorithmstrong elimination orderingminimum weight total dominating set problem for treestotal graph tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Integrity of total transformation graphs ⋮ On the complexity of variations of mixed domination on graphs^†

Cites Work

• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• Triangulated graphs and the elimination process
• Three Partition Refinement Algorithms

This page was built for publication: Strong elimination ordering of the total graph of a tree