Dominating cliques in distance-hereditary graphs
Author:
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 370-381
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dominating cliques in graphs with hypertree structureLecture Notes in Computer Science, 1994
- Centers of chordal graphsGraphs and Combinatorics, 1991
- Finding Dominating Cliques Efficiently, in Strongly Chordal Graphs and Undirected Path Graphs1991
- Completely separable graphsDiscrete Applied Mathematics, 1990
- Distance-Hereditary Graphs, Steiner Trees, and Connected DominationSIAM Journal on Computing, 1988
- On domination problems for permutation and other graphsTheoretical Computer Science, 1987
- Pseudo-modular graphsDiscrete Mathematics, 1986
- Distance-hereditary graphsJournal of Combinatorial Theory, Series B, 1986
- Perfect Graphs1980
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHSThe Quarterly Journal of Mathematics, 1977