On the public citation graph

Snarks with total chromatic number 5

0 signed · 43 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(199610)23:2<139::aid-jgt5>3.0.co;2-uopenalex-snapshot
Fast generation of cubic graphs
inferredcites →https://doi.org/10.1007/978-3-319-31940-7_16openalex-snapshot
Circuit Double Covers of Graphs
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1007/s003730050054openalex-snapshot
Non-Bicritical Critical Snarks
inferredcites →https://doi.org/10.1016/0001-8708(78)90018-xopenalex-snapshot
Edge-colourings of graphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90061-9openalex-snapshot
Snarks of order 18
inferredcites →https://doi.org/10.1016/0012-365x(82)90285-0openalex-snapshot
Note sur la non existence d'un snark d'ordre 16
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/j.dam.2012.07.018openalex-snapshot
House of Graphs: A database of interesting graphs
inferredcites →https://doi.org/10.1016/j.dam.2013.04.006openalex-snapshot
The hunting of a snark with total chromatic number 5
inferredcites →https://doi.org/10.1016/j.disc.2006.03.019openalex-snapshot
Disjoint paths in graphs
inferredcites →https://doi.org/10.1016/j.disc.2011.02.013openalex-snapshot
The total-chromatic number of some families of snarks
inferredcites →https://doi.org/10.1016/s0304-0208(08)73434-0openalex-snapshot
C-Minimal Snarks
inferredcites →https://doi.org/10.1017/cbo9780511863158openalex-snapshot
Circuit Double Cover of Graphs
inferredcites →https://doi.org/10.1017/s0004972700042660openalex-snapshot
Polyhedral decompositions of cubic graphs
inferredcites →https://doi.org/10.1023/a:1022864000162openalex-snapshot
Special Classes 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.1112/jlms/s1-42.1.226openalex-snapshot
The Colour Numbers of Complete Graphs
inferredcites →https://doi.org/10.1112/jlms/s2-3.3.405openalex-snapshot
On Total Chromatic Number of a Graph
inferredcites →https://doi.org/10.4153/cjm-1954-010-9openalex-snapshot
A Contribution to the Theory of Chromatic Polynomials
inferredcites →https://doi.org/10.46298/dmtcs.551openalex-snapshot
Generation of Cubic 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.22125openalex-snapshot
Generation of Cubic Graphs and Snarks with Large Girth
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.2015.10.013openalex-snapshot
On the equitable total chromatic number of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.013openalex-snapshot
Graceful colorings of graphs with maximum degree three
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.010openalex-snapshot
On the total coloring of generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.032openalex-snapshot
Total-colorings of complete multipartite graphs using amalgamations
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.2017.10.036openalex-snapshot
On Type 2 Snarks and Dot Products
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.1016/j.procs.2025.10.325openalex-snapshot
Strong conformable coloring: the conformable coloring for Type 1 graphs
inferred← citeshttps://doi.org/10.1080/09728600.2023.2187960openalex-snapshot
Total colorings-a survey
inferred← citeshttps://doi.org/10.21711/231766362012/rmc4213openalex-snapshot
Total chromatic number of some families of graphs with maximum degree 3
inferred← citeshttps://doi.org/10.21711/231766362015/rmc446openalex-snapshot
Total coloring of snarks is NP-complete
inferred← citeshttps://doi.org/10.3233/jifs-241585openalex-snapshot
The star-chromatic number of snarks and its variants
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05294openalex-snapshot
Cyclic pseudo-{L}oupekine snarks
inferred← citeshttps://doi.org/10.48550/arxiv.1812.05833openalex-snapshot
Total Colourings - A survey
inferred← citeshttps://doi.org/10.5540/03.2017.005.01.0236openalex-snapshot
Uma família infinita de snarks Tipo 1
inferred← citeshttps://doi.org/10.5753/etc.2022.222595openalex-snapshot
The conformable condition for Nanodiscs
inferred← citeshttps://doi.org/10.5753/etc.2023.230129openalex-snapshot
On total coloring of small fullerene nanodiscs
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.5753/etc.2025.7019openalex-snapshot
An infinite family of Type 2 snarks with small girth obtained by Kochol’s Superposition
inferred← citeshttps://doi.org/10.7151/dmgt.2409openalex-snapshot
New results on Type 2 snarks
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.