On the public citation graph

3-Trees in polyhedral maps

https://doi.org/10.1007/bf02808218
0 signed · 18 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02761971openalex-snapshot
Graph theorems for manifolds
inferredcites →https://doi.org/10.1016/0012-365x(88)90075-1openalex-snapshot
Decomposition theorems for the torus, projective plane and Klein bottle
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie
inferredcites →https://doi.org/10.4153/cjm-1966-073-4openalex-snapshot
Trees in Polyhedral Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1097-0118(200102)36:2<67::aid-jgt2>3.0.co;2-copenalex-snapshot
On spanning trees and walks of low maximum degree
inferred← citeshttps://doi.org/10.1006/jctb.1995.1041openalex-snapshot
Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle
inferred← citeshttps://doi.org/10.1006/jctb.1995.1053openalex-snapshot
On the Spectral Radius and the Genus of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-90048-9_7openalex-snapshot
Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number – A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_6openalex-snapshot
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-004-0587-7openalex-snapshot
Connected Factors in Graphs ? a Survey
inferred← citeshttps://doi.org/10.1007/s00373-010-0973-2openalex-snapshot
Spanning Trees: A Survey
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104305openalex-snapshot
Fragile minor-monotone parameters under a random edge perturbation
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.024openalex-snapshot
Spanning trees in 3-connected K3,t-minor-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.07.002openalex-snapshot
Spanning trees in 3-connected -minor-free graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.049openalex-snapshot
Greedy routing via embedding graphs onto semi-metric spaces
inferred← citeshttps://doi.org/10.1137/110826345openalex-snapshot
Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
inferred← citeshttps://doi.org/10.4171/em/241openalex-snapshot
Contractible Hamiltonian cycles in triangulated surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4101openalex-snapshot
Trees and co-trees with constant maximum degree in planar 3-connected graphs
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.