On the public citation graph
On Snarks that are far from being 3-Edge Colorable
0 signed · 42 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/(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.1002/jgt.20545openalex-snapshot
The equivalence of two conjectures of Berge and Fulkerson
inferredcites →https://doi.org/10.1006/jctb.1995.1029openalex-snapshot
Five Cycle Double Covers of Some Cubic Graphs
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1016/j.disc.2010.10.001openalex-snapshot
Three measures of edge-uncolorability
inferredcites →https://doi.org/10.1016/j.disc.2011.08.024openalex-snapshot
On stable cycles and cycle double covers of graphs with large circumference
inferredcites →https://doi.org/10.1016/s0012-365x(00)00205-3openalex-snapshot
On cycle-double covers of graphs of small oddness
inferredcites →https://doi.org/10.1017/s0004972700042660openalex-snapshot
Polyhedral decompositions of cubic graphs
inferredcites →https://doi.org/10.4153/cjm-1954-010-9openalex-snapshot
A Contribution to the Theory of Chromatic Polynomials
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.1007/978-88-7642-475-5_10openalex-snapshot
Snarks with large oddness and small number of vertices
inferred← citeshttps://doi.org/10.1007/s41980-018-0019-8openalex-snapshot
Berge–Fulkerson Coloring for Infinite Families of Snarks
inferred← citeshttps://doi.org/10.1016/j.amc.2024.129101openalex-snapshot
Perfect matching cover indices of generalized rotation snarks
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.013openalex-snapshot
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.041openalex-snapshot
AVD-total-chromatic number of some families of graphs with Δ(G)=3
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.2024.02.006openalex-snapshot
Roman domination and independent Roman domination on graphs with maximum degree three
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.disc.2013.06.006openalex-snapshot
Covering a cubic graph with perfect matchings
inferred← citeshttps://doi.org/10.1016/j.disc.2015.03.017openalex-snapshot
On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113874openalex-snapshot
Rotationally symmetric snarks from voltage graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.042openalex-snapshot
New conjectures on perfect matchings in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.04.004openalex-snapshot
Cubic graphs that cannot be covered with four perfect matchings
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.235openalex-snapshot
Kochol superposition of Goldberg with Semi-blowup snarks is Type 1
inferred← citeshttps://doi.org/10.1109/access.2022.3162215openalex-snapshot
Optimization of the Functional Decomposition of Parallel and Distributed Computations in Graph Coloring With the Use of High-Performance Computing
inferred← citeshttps://doi.org/10.1109/idt52577.2021.9497524openalex-snapshot
On Graph Coloring Analysis Through Visualization
inferred← citeshttps://doi.org/10.37236/6848openalex-snapshot
Measures of Edge-Uncolorability of Cubic Graphs
inferred← citeshttps://doi.org/10.37236/8440openalex-snapshot
Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2013.918796openalex-snapshot
Developments of Fulkerson's Conjecture
inferred← citeshttps://doi.org/10.47749/t/unicamp.2014.932506openalex-snapshot
Sobre a coloração total semiforte
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1871openalex-snapshot
Covering a cubic graph with perfect matchings
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3930openalex-snapshot
Covering cubic graphs with matchings of large size
inferred← citeshttps://doi.org/10.48550/arxiv.1212.3641openalex-snapshot
Small snarks with large oddness
inferred← citeshttps://doi.org/10.48550/arxiv.1302.2655openalex-snapshot
Snarks from a Kaszonyi perspective: a survey
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5427openalex-snapshot
On The Number of Edge-3-Colourings of A Snipped Snark
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05294openalex-snapshot
Cyclic pseudo-{L}oupekine snarks
inferred← citeshttps://doi.org/10.5753/etc.2024.2072openalex-snapshot
Infinite families of Kochol superpositions of Goldberg with Blowup snarks are Type 2
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.