On the public citation graph
Uniform cyclic edge connectivity in cubic graphs
0 signed · 14 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/bfb0102696openalex-snapshot
Classifying K-connected cubic graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90035-1openalex-snapshot
On generating planar 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-540-27810-8_21openalex-snapshot
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s10878-019-00400-6openalex-snapshot
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.046openalex-snapshot
On cyclic edge-connectivity of fullerenes
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.03.003openalex-snapshot
Cyclically five-connected cubic 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.1017/cbo9780511721335.008openalex-snapshot
Recent Excluded Minor Theorems for Graphs
inferred← citeshttps://doi.org/10.1017/s0963548300004417openalex-snapshot
Excluding Minors in Nonplanar Graphs of Girth at Least Five
inferred← citeshttps://doi.org/10.1017/s0963548305007340openalex-snapshot
Splitter Theorems for Cubic Graphs
inferred← citeshttps://doi.org/10.1145/3408127.3408196openalex-snapshot
Distributed Algorithms for Cyclic Edge Connectivity and Cyclic Vertex Connectivity of Cubic Graphs
inferred← citeshttps://doi.org/10.3390/sym10030067openalex-snapshot
Construction of Fullerenes and Pogorelov Polytopes with 5-, 6- and one 7-Gonal Face
inferred← citeshttps://doi.org/10.48550/arxiv.1612.02988openalex-snapshot
Classification of 2-extendable bipartite and cubic non-bipartite vertex-transitive 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.