On the public citation graph
�ber simpliziale Zerf�llungen beliebiger (endlicher oder unendlicher) Graphen
0 signed · 49 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01470944openalex-snapshot
Homomorphiebasen von Graphenmengen
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22837openalex-snapshot
Ban–Linial's Conjecture and treelike snarks
inferred← citeshttps://doi.org/10.1002/jgt.3190110108openalex-snapshot
A separation property of planar triangulations
inferred← citeshttps://doi.org/10.1002/mana.19650280508openalex-snapshot
Einige Bemerkungen über unendliche Graphen
inferred← citeshttps://doi.org/10.1002/mana.19660310110openalex-snapshot
Graphen ohne unendliche Wege
inferred← citeshttps://doi.org/10.1002/mana.19670330108openalex-snapshot
Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
inferred← citeshttps://doi.org/10.1007/978-3-322-84013-4_11openalex-snapshot
Einbettung planarer Graphen in die Ebene
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_18openalex-snapshot
Lombardi Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-7154-7_11openalex-snapshot
Embedding of planar graphs in the plane
inferred← citeshttps://doi.org/10.1007/bf01361186openalex-snapshot
Einbettung von Streckenkomplexen in die Ebene
inferred← citeshttps://doi.org/10.1007/bf02992395openalex-snapshot
Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
inferred← citeshttps://doi.org/10.1007/bf02995937openalex-snapshot
A problem in infinite graph-theory
inferred← citeshttps://doi.org/10.1007/s00373-014-1443-zopenalex-snapshot
Group Chromatic Number of Halin Graphs
inferred← citeshttps://doi.org/10.1007/s00373-021-02429-zopenalex-snapshot
The Sharp Upper Bounds on the $$A_{\alpha }$$-Spectral Radius of $$C_4$$-Free Graphs and Halin Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9423-zopenalex-snapshot
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1007/s12190-020-01489-3openalex-snapshot
On Connected Graphs Having the Maximum Connective Eccentricity Index
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90143-0openalex-snapshot
A note on infinite triangulated graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90084-8openalex-snapshot
Simplicial decompositions of graphs: a survey of applications
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90150-gopenalex-snapshot
Clique-sums, tree-decompositions and compactness
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90330-5openalex-snapshot
Decomposing infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90510-zopenalex-snapshot
Optimal decomposition by clique separators
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90035-9openalex-snapshot
Simplicial decompositions of graphs—Some uniqueness results
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90099-lopenalex-snapshot
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90118-jopenalex-snapshot
Simplicial tree-decompositions of infinite graphs, I
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90093-yopenalex-snapshot
The menger-like property of the tree-width of infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90054-2openalex-snapshot
The structure of TKa-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.020openalex-snapshot
Extremal Halin graphs with respect to the signless Laplacian spectra
inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.019openalex-snapshot
Normal 6-edge-colorings of some bridgeless cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.08.013openalex-snapshot
Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
inferred← citeshttps://doi.org/10.1016/j.disopt.2026.100928openalex-snapshot
On the number of independent sets in Halin graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103832openalex-snapshot
Some snarks are worse than others
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.031openalex-snapshot
A 3-approximation for the pathwidth of Halin graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105425openalex-snapshot
Trees of tangles in abstract separation systems
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.004openalex-snapshot
A 3-approximation for the pathwidth of Halin graphs
inferred← citeshttps://doi.org/10.1016/j.jmaa.2018.09.059openalex-snapshot
Some further results on the eccentric distance sum
inferred← citeshttps://doi.org/10.1016/j.laa.2022.02.036openalex-snapshot
On the Aα- spectral radius of Halin graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00007-8openalex-snapshot
Peakless functions on graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70500-4openalex-snapshot
Simplicial Decompositions of Infinite Graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80014-1openalex-snapshot
On the Representation of Triangulated Graphs in Trees
inferred← citeshttps://doi.org/10.1017/s0305004100065026openalex-snapshot
Simplicial minors and decompositions of graphs
inferred← citeshttps://doi.org/10.1137/050623395openalex-snapshot
Tree-Related Widths of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1145/2933575.2934517openalex-snapshot
Order Invariance on Decomposable Structures
inferred← citeshttps://doi.org/10.1186/s13660-017-1348-5openalex-snapshot
On the Laplacian spectral radii of Halin graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.217.440openalex-snapshot
Embeddings of cubic Halin graphs: Genus distributions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.