Connected domination and dominating clique in trapezoid graphs

DOI10.1016/S0166-218X(99)00127-4zbMath0944.05072MaRDI QIDQ1962037

Ekkehard Köhler

Publication date: 24 September 2000

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

zbMATH Keywords

algorithmtrapezoid graphsconnected dominating setconnected domination numberdominating clique

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Efficient algorithms for the minimum connected domination on trapezoid graphs ⋮ The recognition of triangle graphs ⋮ The hub number of co-comparability graphs

Cites Work

• Unnamed Item
• Trapezoid graphs and their coloring
• Dominations in trapezoid graphs
• Weighted irredundance of interval graphs.
• Domination on Cocomparability Graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Some Efficient Algorithms for Permutation Graphs
• Trapezoid graphs and generalizations, geometry and algorithms

This page was built for publication: Connected domination and dominating clique in trapezoid graphs