Strong elimination ordering of the total graph of a tree
From MaRDI portal
Publication:1201815
DOI10.1016/0166-218X(92)90181-9zbMath0769.05029OpenAlexW2004824881MaRDI QIDQ1201815
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
strongly chordal graphslinear algorithmstrong elimination orderingminimum weight total dominating set problem for treestotal graph tree
Related Items (2)
Integrity of total transformation graphs ⋮ On the complexity of variations of mixed domination on graphs†
Cites Work
This page was built for publication: Strong elimination ordering of the total graph of a tree