On the public citation graph
Classifying K-connected cubic graphs
0 signed · 38 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.1016/0095-8956(74)90034-3openalex-snapshot
A classification of 4-connected graphs
inferredcites →https://doi.org/10.1112/jlms/s2-19.1.7openalex-snapshot
Enumeration of Labelled Graphs I: 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/(sici)1097-0118(199906)31:2<95::aid-jgt2>3.0.co;2-nopenalex-snapshot
An excluded minor theorem for the octahedron
inferred← citeshttps://doi.org/10.1002/jgt.20272openalex-snapshot
An excluded minor theorem for the Octahedron plus an edge
inferred← citeshttps://doi.org/10.1002/jgt.22964openalex-snapshot
Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width
inferred← citeshttps://doi.org/10.1002/jgt.3190090418openalex-snapshot
Enumeration of cyclically 4‐connected cubic graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190170213openalex-snapshot
N‐extendability of symmetric graphs
inferred← citeshttps://doi.org/10.1006/jctb.2000.1968openalex-snapshot
A Characterization of Graphs with No Cube Minor
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_28openalex-snapshot
2.5-Connectivity: Unique Components, Critical Graphs, and Applications
inferred← citeshttps://doi.org/10.1007/bf01206354openalex-snapshot
Uniform cyclic edge connectivity in cubic graphs
inferred← citeshttps://doi.org/10.1007/bf01788138openalex-snapshot
Non removable edges in 3-connected cubic graphs
inferred← citeshttps://doi.org/10.1007/bf01864149openalex-snapshot
Removable edges in cyclically 4-edge-connected cubic graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1973-xopenalex-snapshot
Snarks with Special Spanning Trees
inferred← citeshttps://doi.org/10.1007/s00373-025-02948-zopenalex-snapshot
A Note on 4-connected Planar K1,1,5-minor-free Graphs
inferred← citeshttps://doi.org/10.1007/s00493-005-0025-7openalex-snapshot
Graphs With 3n−6 Edges Not Containing A Subdivision Of K 5
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90294-ropenalex-snapshot
On some conjectures on cubic 3-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90004-hopenalex-snapshot
Edge reductions in cyclically k-connected cubic graphs
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.2018.07.005openalex-snapshot
A chain theorem for 4-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/j.procs.2023.08.218openalex-snapshot
Reductions for the 3-Decomposition Conjecture
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00053-8openalex-snapshot
Face extensions in planar cubic graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00593-0openalex-snapshot
Generating r-regular graphs
inferred← citeshttps://doi.org/10.1017/s0963548305007340openalex-snapshot
Splitter Theorems for Cubic Graphs
inferred← citeshttps://doi.org/10.1080/09728600.2024.2333397openalex-snapshot
On cyclically 4-connected cubic graphs
inferred← citeshttps://doi.org/10.1137/130937974openalex-snapshot
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture
inferred← citeshttps://doi.org/10.1142/s0219265921420111openalex-snapshot
A Note on Connectivity of a Cubic Graph
inferred← citeshttps://doi.org/10.1142/s0219265921500304openalex-snapshot
A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs
inferred← citeshttps://doi.org/10.15673/tmgc.v11i2.1026openalex-snapshot
On measures of nonplanarity of cubic graphs
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.31390/gradschool_dissertations.3385openalex-snapshot
Splitter theorems for 3- and 4-regular graphs
inferred← citeshttps://doi.org/10.37236/11128openalex-snapshot
Towards Obtaining a 3-Decomposition From a Perfect Matching
inferred← citeshttps://doi.org/10.37236/8594openalex-snapshot
On Essentially 4-Edge-Connected Cubic Bricks
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07706openalex-snapshot
A note on $Oct_{1}^{+}$-free graphs and $Oct_{2}^{+}$-free 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.