On the public citation graph

Factorisation of Snarks

0 signed · 21 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.1002/(sici)1097-0118(199806)28:2<57::aid-jgt1>3.0.co;2-dopenalex-snapshot
A survey on snarks and new results: Products, reducibility and a computer search
inferredcites →https://doi.org/10.1002/jgt.3190110104openalex-snapshot
Decomposition of snarks
inferredcites →https://doi.org/10.1006/jctb.1996.0032openalex-snapshot
Snarks without Small Cycles
inferredcites →https://doi.org/10.1007/s003730050054openalex-snapshot
Non-Bicritical Critical Snarks
inferredcites →https://doi.org/10.1016/0095-8956(81)90030-7openalex-snapshot
Construction of class 2 graphs with maximum vertex degree 3
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.7151/dmgt.1081openalex-snapshot
Cyclically 5-edge connected non-bicritical critical snarks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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.06.019openalex-snapshot
Extremal spectral radius of graphs with cyclic edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.019openalex-snapshot
6-decomposition of snarks
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.1051/ro/2024068openalex-snapshot
The hardness of recognising poorly matchable graphs and the hunting of the d-snark
inferred← citeshttps://doi.org/10.1063/5.0200632openalex-snapshot
Fractal networks: Topology, dimension, and complexity
inferred← citeshttps://doi.org/10.1093/comnet/cnaa037openalex-snapshot
Graph fractal dimension and the structure of fractal networks
inferred← citeshttps://doi.org/10.1201/b16132-29openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.37236/3529openalex-snapshot
From Edge-Coloring to Strong Edge-Coloring
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.7151/dmgt.2204openalex-snapshot
Critical and flow-critical snarks coincide
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.