Simplicial decompositions of graphs: A survey of applications
type: Item
instance of: scholarly article
title: Simplicial decompositions of graphs: A survey of applications
zbMATH Open document ID: 0669.05053
DOI: 10.1016/0012-365X(89)90084-8
author: Reinhard Diestel
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 4095513
zbMATH Keywords: simplicial decompositions
zbMATH Keywords: excluded minor theorems
zbMATH Keywords: extremal graph theorems
zbMATH Keywords: interval graphs
zbMATH Keywords: infinite graph theory
MaRDI profile type: Publication
cites work: On a pursuit game played on graphs for which a minor is excluded
cites work: Forbidden minors characterization of partial 3-trees
cites work: Q3852212
cites work: A characterisation of rigid circuit graphs
cites work: Q5728132
cites work: On the Desirability of Acyclic Database Schemes
cites work: Star-cutsets and perfect graphs
cites work: On universal graphs with forbidden topological subgraphs
cites work: On the problem of finding small subdivision and homomorphism bases for classes of countable graphs
cites work: A separation property of planar triangulations
cites work: Simplicial minors and decompositions of graphs
cites work: Tree-decompositions, tree-representability and chordal graphs
cites work: Q3809834
cites work: On end-faithful spanning trees in infinite graphs
cites work: On rigid circuit graphs
cites work: Homomorphism theorems for graphs
cites work: Q4083473
cites work: Q5808059
cites work: Some remarks on universal graphs
cites work: Connected cutsets of a graph and triangle bases of the cycle space
cites work: Incidence matrices and interval graphs
cites work: Q5341588
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Über einen Satz von K.Wagner zum Vierfarbenproblem
cites work: Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
cites work: Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
cites work: Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
cites work: Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
cites work: Q4117857
cites work: A note on infinite triangulated graphs
cites work: Q3929755
cites work: Simplicial Decompositions: Some New Aspects and Applications
cites work: Some remarks on interval graphs
cites work: On the representation of triangulation graphs in trees
cites work: Über unendliche Wege in Graphen
cites work: Homomorphiebasen von Graphenmengen
cites work: Q5632598
cites work: On Certain Homomorphism Properties of Graphs I.
cites work: On a certain homomorphism properties of graphs II.
cites work: Q3789592
cites work: Anwendung einer Methode von K. Wagner bei Färbungsproblemen für Graphen
cites work: Wurzelbäume und unendliche Wege in Graphen
cites work: Universal graphs without large bipartite subgraphs
cites work: Q3834094
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Q4734791
cites work: Q3315548
cites work: Vertex-to-vertex pursuit in a graph
cites work: A problem of Ulam on planar graphs
cites work: Universal graphs and universal functions
cites work: Q3222217
cites work: Decomposition by clique separators
cites work: Some Homeomorphism Properties of Graphs
cites work: A decomposition theory for matroids. IV: Decomposition of graphs
cites work: Non-separating induced cycles in graphs
cites work: Über eine Eigenschaft der ebenen Komplexe
cites work: Q5766469
cites work: Bemerkungen zu Hadwigers Vermutung
cites work: Infinite triangulated graphs
cites work: Q5184933