On greedy matching ordering and greedy matchable graphs
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 184-198
- https://doi.org/10.1007/bfb0024498
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- LexBFS-orderings and powers of chordal graphsDiscrete Mathematics, 1997
- Chordality properties on graphs and minimal conceptual connections in semantic data modelsJournal of Computer and System Sciences, 1986
- Weakly triangulated graphsJournal of Combinatorial Theory, Series B, 1985
- Totally-Balanced and Greedy MatricesSIAM Journal on Algebraic Discrete Methods, 1985
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- A characterization of ptolemaic graphsJournal of Graph Theory, 1981
- Perfect Elimination and Chordal Bipartite GraphsJournal of Graph Theory, 1978
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHSThe Quarterly Journal of Mathematics, 1977