Simplicial decompositions of graphs - some uniqueness results

DOI10.1016/0095-8956(87)90035-9zbMath0582.05045OpenAlexW2007952538MaRDI QIDQ1068851

Reinhard Diestel

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90035-9

zbMATH Keywords

primessimplicial decompositionprime factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items

Optimal decomposition by clique separators, An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph, Representations of graphs and networks (coding, layouts and embeddings), Some remarks on universal graphs, On the problem of finding small subdivision and homomorphism bases for classes of countable graphs, On universal graphs with forbidden topological subgraphs, The dense amalgam of metric compacta and topological characterization of boundaries of free products of groups

Cites Work

• Unnamed Item
• Unnamed Item
• On the problem of finding small subdivision and homomorphism bases for classes of countable graphs
• Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
• Simplicial tree-decompositions of infinite graphs. I
• A separation property of planar triangulations