Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs
- 1 February 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 99 (1-3) , 427-442
- https://doi.org/10.1016/s0166-218x(99)00149-3
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On greedy matching ordering and greedy matchable graphsPublished by Springer Nature ,1997
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graphInformation Processing Letters, 1995
- Doubly lexical ordering of dense 0–1 matricesInformation Processing Letters, 1993
- Labeling algorithms for domination problems in sun-free chordal graphsDiscrete Applied Mathematics, 1988
- Steiner trees, connected domination and strongly chordal graphsNetworks, 1985
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Perfect Elimination and Chordal Bipartite GraphsJournal of Graph Theory, 1978
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972