On the public citation graph

On the lengths of cycles in planar graphs

https://doi.org/10.1007/bfb0059437
0 signed · 12 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.1111/j.1749-6632.1970.tb45143.xopenalex-snapshot
3-VALENT 3-POLYTOPES WITH FACES HAVING FEWER THAN 7 EDGES
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

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.22712openalex-snapshot
Find subtrees of specified weight and cycles of specified length in linear time
inferred← citeshttps://doi.org/10.1002/jgt.23152openalex-snapshot
Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles
inferred← citeshttps://doi.org/10.1002/jgt.3190010109openalex-snapshot
Some recent results in hamiltonian graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_8openalex-snapshot
Forbidden Trees
inferred← citeshttps://doi.org/10.1007/bfb0070393openalex-snapshot
Cycle lengths in polytopal graphs
inferred← citeshttps://doi.org/10.1007/bfb0092288openalex-snapshot
A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences
inferred← citeshttps://doi.org/10.1007/s00373-021-02358-xopenalex-snapshot
Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90073-5openalex-snapshot
Some 4-valent, 3-connected, planar, almost pancyclic graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00163-8openalex-snapshot
Pancyclicity and NP-completeness in planar graphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17776.xopenalex-snapshot
SOME HAMILTONIAN COUNTEREXAMPLES
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.