Separability generalizes Dirac's theorem
Authors:
- Anne BerryABAnne Berry
- Jean-Paul BordatJBJean-Paul Bordat
- 1 May 1998
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 84 (1-3) , 43-53
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the semi-perfect eliminationAdvances in Applied Mathematics, 1988
- Decomposition by clique separatorsDiscrete Mathematics, 1985
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Some aspects of perfect elimination orderings in chordal graphsDiscrete Applied Mathematics, 1984
- Perfect Elimination and Chordal Bipartite GraphsJournal of Graph Theory, 1978
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrixJournal of Mathematical Analysis and Applications, 1976
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961