r-Domination problems on homogeneously orderable graphs

DOI10.1007/3-540-60249-6_52OpenAlexW159864121MaRDI QIDQ5055891

Falk Nicolai, Feodor F. Dragan

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60249-6_52

zbMATH Keywords

Steiner tree problemchordal graphSteiner treequadratic timevertex function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• On domination problems for permutation and other graphs
• Topics on domination
• Dominating cliques in chordal graphs
• Dominating cliques in distance-hereditary graphs

This page was built for publication: r-Domination problems on homogeneously orderable graphs