Connected domination and dominating clique in trapezoid graphs

DOI10.1016/S0166-218X(99)00127-4zbMATH Open0944.05072MaRDI QIDQ1962037FDOQ1962037

Authors: Ekkehard Köhler 

Publication date: 24 September 2000

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

Recommendations

• Efficient algorithms for the minimum connected domination on trapezoid graphs
• scientific article; zbMATH DE number 1696629
• Trapezoid graphs and generalizations, geometry and algorithms
• scientific article; zbMATH DE number 992410
• Parallel algorithms for the domination problems in trapezoid graphs

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)

Cites Work

• Domination on Cocomparability Graphs
• Trapezoid graphs and their coloring
• Dominations in trapezoid graphs
• Title not available (Why is that?)
• Trapezoid graphs and generalizations, geometry and algorithms
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Weighted irredundance of interval graphs.
• Some Efficient Algorithms for Permutation Graphs

Cited In (5)

• Efficient algorithms for the minimum connected domination on trapezoid graphs
• The recognition of triangle graphs
• The hub number of co-comparability graphs
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962037)