Simplicial decompositions of graphs: a survey of applications
- 31 May 1989
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 75 (1-3) , 121-144
- https://doi.org/10.1016/0012-365x(89)90084-8
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- Forbidden minors characterization of partial 3-treesDiscrete Mathematics, 1990
- Tree-decompositions, tree-representability and chordal graphsDiscrete Mathematics, 1988
- Simplicial minors and decompositions of graphsMathematical Proceedings of the Cambridge Philosophical Society, 1988
- A separation property of planar triangulationsJournal of Graph Theory, 1987
- On a pursuit game played on graphs for which a minor is excludedJournal of Combinatorial Theory, Series B, 1986
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphsDiscrete Mathematics, 1985
- Star-cutsets and perfect graphsJournal of Combinatorial Theory, Series B, 1985
- On Universal Graphs With Forbidden Topological SubgraphsEuropean Journal of Combinatorics, 1985
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974