On the public citation graph

Removable edges in cyclically 4-edge-connected cubic graphs

https://doi.org/10.1007/bf01864149
0 signed · 19 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/bf01864172openalex-snapshot
The number of contractible edges in 3-connected graphs
inferredcites →https://doi.org/10.1007/bf02579387openalex-snapshot
Contractible edges in triangle-free graphs
inferredcites →https://doi.org/10.1007/bfb0102696openalex-snapshot
Classifying K-connected cubic graphs
inferredcites →https://doi.org/10.1016/0095-8956(87)90065-7openalex-snapshot
Contractible edges in 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.1007/978-3-030-83823-2_93openalex-snapshot
Decomposing Cubic Graphs with Cyclic Connectivity 5
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_21openalex-snapshot
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/bf01788138openalex-snapshot
Non removable edges in 3-connected cubic graphs
inferred← citeshttps://doi.org/10.1007/s00026-026-00858-2openalex-snapshot
Algorithms for the Generation of Snarks
inferred← citeshttps://doi.org/10.1007/s00373-004-0566-zopenalex-snapshot
Removable Edges in Longest Cycles of 4-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1973-xopenalex-snapshot
Snarks with Special Spanning Trees
inferred← citeshttps://doi.org/10.1016/j.disc.2004.05.015openalex-snapshot
Removable edges in a cycle of a 4-connected graph
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113036openalex-snapshot
Decomposition of cubic graphs with cyclic connectivity 5
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114827openalex-snapshot
Strictly critical snarks with girth or cyclic connectivity equal to 6
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.02.009openalex-snapshot
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.01.007openalex-snapshot
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
inferred← citeshttps://doi.org/10.1016/s0368-2048(97)00057-1openalex-snapshot
Theo Thole and the graphical methods
inferred← citeshttps://doi.org/10.1109/cso.2011.219openalex-snapshot
Remarks on the Removable Edges of a Spectial Network
inferred← citeshttps://doi.org/10.26493/1855-3974.1601.e75openalex-snapshot
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
inferred← citeshttps://doi.org/10.3990/1.9789036528924openalex-snapshot
Removable edges in 4-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.