A note on \(r\)-dominating cliques

DOI10.1016/S0012-365X(97)00076-9zbMath0891.05056MaRDI QIDQ1382816

Victor Chepoi

Publication date: 6 July 1998

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

zbMATH Keywords

isometric subgraph\(r\)-dominating cliquedominating radius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

Helly-gap of a graph and vertex eccentricities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Weakly triangulated graphs
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
• On the Helly property working as a compactness criterion on graphs
• Distance-hereditary graphs
• Pseudo-modular graphs
• On local convexity in graphs
• On domination problems for permutation and other graphs
• Hereditary modular graphs
• Dismantling absolute retracts of reflexive graphs
• A Helly theorem in weakly modular space
• Topics on domination
• Dominating cliques in chordal graphs
• On the semi-perfect elimination
• The smallest graph variety containing all paths
• A characterisation of rigid circuit graphs
• Conditions for invariance of set diameters under d-convexification in a graph
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Perfect Elimination and Chordal Bipartite Graphs
• Dominating cliques in distance-hereditary graphs

This page was built for publication: A note on \(r\)-dominating cliques