r-domination problems on homogeneously orderable graphs

DOI<121::AID-NET6>3.0.CO;2-E 10.1002/(SICI)1097-0037(199709)30:2<121::AID-NET6>3.0.CO;2-EzbMath0885.90108OpenAlexW2110969255MaRDI QIDQ4361182

Falk Nicolai, Feodor F. Dragan

Publication date: 22 April 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199709)30:2<121::aid-net6>3.0.co;2-e

zbMATH Keywords

homogeneously orderable graphs\(r\)-dominating cliques

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs ⋮ On compact and efficient routing in certain graph classes ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs

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