Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
From MaRDI portal
Publication:2393913
DOI10.1007/BF01363288zbMath0125.11605MaRDI QIDQ2393913
Publication date: 1964
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/161213
Related Items
Optimal decomposition by clique separators, On the \(A_\alpha\)- spectral radius of Halin graphs, On connected graphs having the maximum connective eccentricity index, Extremal Halin graphs with respect to the signless Laplacian spectra, Simplicial tree-decompositions of infinite graphs. I, Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions, Simplicial decompositions of graphs: A survey of applications, The Menger-like property of the three-width of infinite graphs, Enumerating graph embeddings and partial-duals by genus and Euler genus, Ban–Linial's Conjecture and treelike snarks, Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size, Some snarks are worse than others, \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees, A note on infinite triangulated graphs, Trees of tangles in abstract separation systems, Group chromatic number of Halin graphs, Decomposing infinite graphs, Bounded graphs, Peakless functions on graphs, A 3-approximation for the pathwidth of Halin graphs, A 3-approximation for the pathwidth of Halin graphs, On the Laplacian spectral radii of Halin graphs, Simplicial minors and decompositions of graphs, A problem in infinite graph-theory, Treelike snarks, Some further results on the eccentric distance sum, Einbettung von Streckenkomplexen in die Ebene, Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl, Clique-sums, tree-decompositions and compactness, Normal 6-edge-colorings of some bridgeless cubic graphs, The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs, On the representation of triangulation graphs in trees, Simplicial decompositions of graphs - some uniqueness results
Cites Work
