On the public citation graph

The number of contractible edges in 3-connected graphs

https://doi.org/10.1007/bf01864172
0 signed · 16 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.1016/0095-8956(87)90065-7openalex-snapshot
Contractible edges in 3-connected graphs
inferredcites →https://doi.org/10.1016/s1385-7258(61)50045-5openalex-snapshot
A theory of 3-connected 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/jgt.21635openalex-snapshot
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
inferred← citeshttps://doi.org/10.1006/jctb.1994.1022openalex-snapshot
Contractile Triples in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70666-3_2openalex-snapshot
Contractible Edges in a k-Connected Graph
inferred← citeshttps://doi.org/10.1007/bf01864149openalex-snapshot
Removable edges in cyclically 4-edge-connected cubic graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02103-5openalex-snapshot
Contractible Edges and Removable Edges in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02890-0openalex-snapshot
Contractible Edges in Spanning Trees of 3-Connected Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00078-wopenalex-snapshot
A remark on the connectivity of the complement of a 3-connected graph
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90018-3openalex-snapshot
Contractible edges in longest cycles in non-Hamiltonian graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113321openalex-snapshot
Properly 3-contractible edges in a minimally 3-connected graph
inferred← citeshttps://doi.org/10.1016/j.disc.2026.114994openalex-snapshot
Deletable edges in 3-connected graphs and their applications
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.005openalex-snapshot
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)00120-4openalex-snapshot
On minimally 3-connected graphs on a surface
inferred← citeshttps://doi.org/10.1137/05062189xopenalex-snapshot
A Theorem About a Contractible and Light Edge
inferred← citeshttps://doi.org/10.17169/refubium-18086openalex-snapshot
Structure and constructions of 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.