Simplicial decompositions of graphs: A survey of applications
From MaRDI portal
Publication:1118617
DOI10.1016/0012-365X(89)90084-8zbMath0669.05053MaRDI QIDQ1118617
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
interval graphsinfinite graph theorysimplicial decompositionsexcluded minor theoremsextremal graph theorems
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Optimal decomposition by clique separators, Simplicial tree-decompositions of infinite graphs. I, Critical exponents of graphs, On the Colin de Verdière number of graphs, Decomposition by maxclique separators, Decomposing infinite graphs, Peakless functions on graphs, Evaluating Datalog via tree automata and cycluits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bemerkungen zu Hadwigers Vermutung
- On rigid circuit graphs
- On the representation of triangulation graphs in trees
- Forbidden minors characterization of partial 3-trees
- Some remarks on interval graphs
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphs
- Decomposition by clique separators
- On universal graphs with forbidden topological subgraphs
- Connected cutsets of a graph and triangle bases of the cycle space
- On a pursuit game played on graphs for which a minor is excluded
- Tree-decompositions, tree-representability and chordal graphs
- Star-cutsets and perfect graphs
- Homomorphiebasen von Graphenmengen
- Non-separating induced cycles in graphs
- A problem of Ulam on planar graphs
- A note on infinite triangulated graphs
- Infinite triangulated graphs
- Vertex-to-vertex pursuit in a graph
- A characterisation of rigid circuit graphs
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- Über unendliche Wege in Graphen
- Anwendung einer Methode von K. Wagner bei Färbungsproblemen für Graphen
- Incidence matrices and interval graphs
- Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
- Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
- Über einen Satz von K.Wagner zum Vierfarbenproblem
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Homomorphism theorems for graphs
- A decomposition theory for matroids. IV: Decomposition of graphs
- Über eine Eigenschaft der ebenen Komplexe
- On the Desirability of Acyclic Database Schemes
- Simplicial minors and decompositions of graphs
- On end-faithful spanning trees in infinite graphs
- Some Homeomorphism Properties of Graphs
- Representation of a finite graph by a set of intervals on the real line
- Universal graphs without large bipartite subgraphs
- On a certain homomorphism properties of graphs II.
- A separation property of planar triangulations
- Simplicial Decompositions: Some New Aspects and Applications
- Universal graphs and universal functions
- Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
- Wurzelbäume und unendliche Wege in Graphen
- On Certain Homomorphism Properties of Graphs I.
- A Characterization of Comparability Graphs and of Interval Graphs
- Some remarks on universal graphs
