On the public citation graph

Constructing Hypohamiltonian Snarks with Cyclic Connectivity $5$ and $6$

https://doi.org/10.37236/936
0 signed · 20 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.1002/(sici)1097-0118(199607)22:3<253::aid-jgt6>3.0.co;2-lopenalex-snapshot
Decompositions and reductions of snarks
inferredcites →https://doi.org/10.1006/jctb.1996.0032openalex-snapshot
Snarks without Small Cycles
inferredcites →https://doi.org/10.1007/bf02023582openalex-snapshot
Smallest maximally nonhamiltonian graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90074-0openalex-snapshot
Hypohamiltonian and hypotraceable graphs
inferredcites →https://doi.org/10.1016/s0012-365x(97)00255-0openalex-snapshot
Classifications and characterizations of snarks
inferredcites →https://doi.org/10.1080/00029890.1975.11993805openalex-snapshot
Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
inferredcites →https://doi.org/10.1137/0205049openalex-snapshot
The Planar Hamiltonian Circuit Problem is NP-Complete
inferredcites →https://doi.org/10.1201/9781584888017.ch11openalex-snapshot
Edge Colorings of Graphs
inferredcites →https://doi.org/10.3406/barb.1977.58236openalex-snapshot
Infinite families of hypohamiltonian graphs
inferredcites →https://doi.org/10.4153/cmb-1973-008-9openalex-snapshot
Flip-Flops in Hypohamiltonian 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.20386openalex-snapshot
Spanning even subgraphs of 3‐edge‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.21798openalex-snapshot
1‐Factor and Cycle Covers of Cubic Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21815openalex-snapshot
On Hypohamiltonian and Almost Hypohamiltonian Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22122openalex-snapshot
On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable
inferred← citeshttps://doi.org/10.1007/s00373-010-0968-zopenalex-snapshot
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7
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.ejc.2024.104038openalex-snapshot
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
inferred← citeshttps://doi.org/10.37236/6848openalex-snapshot
Measures of Edge-Uncolorability of Cubic Graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2013.918796openalex-snapshot
Developments of Fulkerson's Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07156openalex-snapshot
On measures of edge-uncolorability of cubic graphs: A brief survey and some new results
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.