On the public citation graph
Small Snarks with Large Oddness
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.1002/rsa.3240030202openalex-snapshot
Almost all cubic graphs are Hamiltonian
inferredcites →https://doi.org/10.1006/eujc.2001.0563openalex-snapshot
Superposition and Constructions of Graphs Without Nowhere-zero k-flows
inferredcites →https://doi.org/10.1006/jctb.1995.1029openalex-snapshot
Five Cycle Double Covers of Some Cubic Graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90133-3openalex-snapshot
The number of cycles in 2-factors of cubic graphs
inferredcites →https://doi.org/10.1016/0095-8956(90)90067-aopenalex-snapshot
Covering weighted graphs by even subgraphs
inferredcites →https://doi.org/10.1016/j.disc.2003.05.005openalex-snapshot
Measurements of edge-uncolorability
inferredcites →https://doi.org/10.1016/j.jctb.2004.11.003openalex-snapshot
Double covers of cubic graphs with oddness 4
inferredcites →https://doi.org/10.1016/s0012-365x(97)00255-0openalex-snapshot
Classifications and characterizations of snarks
inferredcites →https://doi.org/10.37236/3430openalex-snapshot
On Snarks that are far from being 3-Edge Colorable
inferredcites →https://doi.org/10.46298/dmtcs.3465openalex-snapshot
Cycles intersecting edge-cuts of prescribed sizes
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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.22014openalex-snapshot
Petersen Cores and the Oddness of Cubic Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22125openalex-snapshot
Generation of Cubic Graphs and Snarks with Large Girth
inferred← citeshttps://doi.org/10.1002/jgt.22184openalex-snapshot
Berge–Fulkerson coloring for C(8)‐linked graphs
inferred← citeshttps://doi.org/10.1002/jgt.23231openalex-snapshot
Berge's Conjecture for Cubic Graphs With Small Colouring Defect
inferred← citeshttps://doi.org/10.1016/j.dam.2018.02.021openalex-snapshot
Weak oddness as an approximation of oddness and resistance in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.035openalex-snapshot
On S -packing edge-colorings of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.020openalex-snapshot
The smallest nontrivial snarks of oddness 4
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.006openalex-snapshot
Even Cycle Decompositions of index 3 by a novel coloring technique
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.001openalex-snapshot
4-coverable snarks, perfect matching cover, and Isaacs product
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.032openalex-snapshot
An infinite family of normal 5-edge colorable superpositioned snarks
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.014openalex-snapshot
Oddness to resistance ratios in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113040openalex-snapshot
Girth, oddness, and colouring defect of snarks
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113874openalex-snapshot
Rotationally symmetric snarks from voltage graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103344openalex-snapshot
Berge–Fulkerson coloring for some families of superposition snarks
inferred← citeshttps://doi.org/10.1137/130942966openalex-snapshot
Avoiding 5-Circuits in 2-Factors of Cubic Graphs
inferred← citeshttps://doi.org/10.1137/19m1241866openalex-snapshot
Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
inferred← citeshttps://doi.org/10.1137/22m1472425openalex-snapshot
5-Cycle Double Covers, 4-Flows, and Catlin Reduction
inferred← citeshttps://doi.org/10.37236/4379openalex-snapshot
Avoiding 7-Circuits in 2-Factors of Cubic Graphs
inferred← citeshttps://doi.org/10.37236/6848openalex-snapshot
Measures of Edge-Uncolorability of Cubic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.02949openalex-snapshot
Weak oddness as an approximation of oddness and resistance in cubic graphs
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
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05294openalex-snapshot
Cyclic pseudo-{L}oupekine snarks
inferred← citeshttps://doi.org/10.48550/arxiv.1711.10906openalex-snapshot
On S-packing edge-colorings of cubic graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2194openalex-snapshot
Coverings of cubic graphs and 3-edge colorability
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.