On the public citation graph
Measures of Edge-Uncolorability of Cubic Graphs
0 signed · 104 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/(sici)1097-0118(199807)28:3<155::aid-jgt5>3.0.co;2-jopenalex-snapshot
On (k,d)-colorings and fractional nowhere-zero flows
inferredcites →https://doi.org/10.1002/1097-0118(200101)36:1<24::aid-jgt3>3.0.co;2-qopenalex-snapshot
Circular flow numbers of regular multigraphs
inferredcites →https://doi.org/10.1002/jgt.20162openalex-snapshot
On the strong circular 5‐flow conjecture
inferredcites →https://doi.org/10.1002/jgt.20545openalex-snapshot
The equivalence of two conjectures of Berge and Fulkerson
inferredcites →https://doi.org/10.1002/jgt.21798openalex-snapshot
1‐Factor and Cycle Covers of Cubic Graphs
inferredcites →https://doi.org/10.1002/jgt.22014openalex-snapshot
Petersen Cores and the Oddness of Cubic Graphs
inferredcites →https://doi.org/10.1002/jgt.22065openalex-snapshot
Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4
inferredcites →https://doi.org/10.1006/jctb.1994.1039openalex-snapshot
Fulkerson′s Conjecture and Circuit Covers
inferredcites →https://doi.org/10.1006/jctb.1995.1029openalex-snapshot
Five Cycle Double Covers of Some Cubic Graphs
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-3-7643-7400-6_7openalex-snapshot
Excessive Factorizations of Regular Graphs
inferredcites →https://doi.org/10.1007/bf01228237openalex-snapshot
Some remarks on the chromatic index of a graph
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1007/bf01885700openalex-snapshot
The chromatic class of a multigraph
inferredcites →https://doi.org/10.1007/bf02773688openalex-snapshot
A construction of 3-connected graphs
inferredcites →https://doi.org/10.1007/s00373-012-1145-3openalex-snapshot
On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three
inferredcites →https://doi.org/10.1007/s00373-014-1464-7openalex-snapshot
Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow
inferredcites →https://doi.org/10.1007/s00493-014-2550-4openalex-snapshot
Sparsely intersecting perfect matchings in cubic graphs
inferredcites →https://doi.org/10.1007/s00493-019-3268-0openalex-snapshot
Girth Six Cubic Graphs Have Petersen Minors
inferredcites →https://doi.org/10.1007/s11786-015-0227-zopenalex-snapshot
Berge–Fulkerson Conjecture on Certain 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)90285-0openalex-snapshot
Note sur la non existence d'un snark d'ordre 16
inferredcites →https://doi.org/10.1016/0012-365x(95)00237-qopenalex-snapshot
A cyclically 6-edge-connected snark of order 118
inferredcites →https://doi.org/10.1016/0095-8956(81)90029-0openalex-snapshot
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
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.aml.2008.06.052openalex-snapshot
Color-character of uncolorable cubic graphs
inferredcites →https://doi.org/10.1016/j.dam.2014.03.001openalex-snapshot
On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
inferredcites →https://doi.org/10.1016/j.dam.2018.02.021openalex-snapshot
Weak oddness as an approximation of oddness and resistance in cubic graphs
inferredcites →https://doi.org/10.1016/j.disc.2003.05.005openalex-snapshot
Measurements of edge-uncolorability
inferredcites →https://doi.org/10.1016/j.disc.2006.02.003openalex-snapshot
Irreducible snarks of given order and cyclic connectivity
inferredcites →https://doi.org/10.1016/j.disc.2008.11.017openalex-snapshot
Approximating the maximum 3-edge-colorable subgraph problem
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.09.020openalex-snapshot
Measures of edge-uncolorability
inferredcites →https://doi.org/10.1016/j.disc.2013.06.006openalex-snapshot
Covering a cubic graph with perfect matchings
inferredcites →https://doi.org/10.1016/j.disc.2018.10.014openalex-snapshot
Oddness to resistance ratios in cubic graphs
inferredcites →https://doi.org/10.1016/j.endm.2013.10.047openalex-snapshot
Snarks and Flow-Critical Graphs
inferredcites →https://doi.org/10.1016/j.endm.2015.07.033openalex-snapshot
A Faster Test for 4-Flow-Criticality in Snarks
inferredcites →https://doi.org/10.1016/j.jctb.2009.12.001openalex-snapshot
Smallest counterexample to the 5-flow conjecture has girth at least eleven
inferredcites →https://doi.org/10.1016/j.jctb.2016.05.010openalex-snapshot
A new proof of Seymour's 6-flow theorem
inferredcites →https://doi.org/10.1016/s0012-365x(96)00256-7openalex-snapshot
The construction and reduction of strong snarks
inferredcites →https://doi.org/10.1016/s0012-365x(97)00255-0openalex-snapshot
Classifications and characterizations of snarks
inferredcites →https://doi.org/10.1016/s0021-9800(66)80004-2openalex-snapshot
On the algebraic theory of graph colorings
inferredcites →https://doi.org/10.1016/s0095-8956(03)00080-7openalex-snapshot
Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks
inferredcites →https://doi.org/10.1016/s1385-7258(61)50045-5openalex-snapshot
A theory of 3-connected graphs
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.1080/09728600.2013.12088743openalex-snapshot
A simple and fast heuristic algorithm for edge-coloring of graphs
inferredcites →https://doi.org/10.1090/s0002-9939-08-09698-6openalex-snapshot
Polyhedral embeddings of snarks in orientable surfaces
inferredcites →https://doi.org/10.1112/plms/s2-51.6.474openalex-snapshot
On the Imbedding of Linear Graphs in Surfaces
inferredcites →https://doi.org/10.1112/plms/s3-38.3.423openalex-snapshot
On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
inferredcites →https://doi.org/10.1137/130942966openalex-snapshot
Avoiding 5-Circuits in 2-Factors of Cubic Graphs
inferredcites →https://doi.org/10.1142/2443openalex-snapshot
Combinatorics, Graph Theory, Algorithms and Applications
inferredcites →https://doi.org/10.2307/2284618openalex-snapshot
Combinatorial Mathematics and Its Applications.
inferredcites →https://doi.org/10.2307/2313923openalex-snapshot
A Proof of 4-Coloring the Edges of a Cubic Graph
inferredcites →https://doi.org/10.26493/1855-3974.1176.9b7openalex-snapshot
On hypohamiltonian snarks and a theorem of Fiorini
inferredcites →https://doi.org/10.26493/1855-3974.288.11aopenalex-snapshot
Petersen-colorings and some families of snarks
inferredcites →https://doi.org/10.26493/1855-3974.49.b88openalex-snapshot
Relating embedding and coloring properties 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.37236/3629openalex-snapshot
Some Results on the Structure of Multipoles in the Study of Snarks
inferredcites →https://doi.org/10.37236/936openalex-snapshot
Constructing Hypohamiltonian Snarks with Cyclic Connectivity $5$ and $6$
inferredcites →https://doi.org/10.4153/cjm-1954-010-9openalex-snapshot
A Contribution to the Theory of Chromatic Polynomials
inferredcites →https://doi.org/10.48550/arxiv.0904.1296openalex-snapshot
On the perfect matching index of bridgeless cubic graphs
inferredcites →https://doi.org/10.48550/arxiv.1702.07156openalex-snapshot
On measures of edge-uncolorability of cubic graphs: A brief survey and some new results
inferredcites →https://doi.org/10.5860/choice.50-0329openalex-snapshot
Graph edge coloring: Vizing's theorem and Goldberg's conjecture
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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.1002/jgt.23231openalex-snapshot
Berge's Conjecture for Cubic Graphs With Small Colouring Defect
inferred← citeshttps://doi.org/10.1007/s00026-022-00583-6openalex-snapshot
3-Critical Subgraphs of Snarks
inferred← citeshttps://doi.org/10.1007/s00026-026-00858-2openalex-snapshot
Algorithms for the Generation of Snarks
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.12.014openalex-snapshot
Normal 5-edge-colorings of a family of Loupekhine snarks
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128493openalex-snapshot
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph
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.2023.09.026openalex-snapshot
Flow resistance to resistance ratios in cubic graphs
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.ejc.2020.103220openalex-snapshot
Superposition of snarks revisited
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103327openalex-snapshot
Partially normal 5-edge-colorings of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103832openalex-snapshot
Some snarks are worse than others
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.1016/j.procs.2025.10.292openalex-snapshot
Colouring defect of strong snarks
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.293openalex-snapshot
Short cycle covers and the colouring defect of a cubic graph
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.294openalex-snapshot
Are there any permutation snarks on 6 (mod 8) vertices?
inferred← citeshttps://doi.org/10.12677/aam.2026.154166openalex-snapshot
Partial Normal 6-Edge-Coloring of Non-Trivial Snarks with Small Coloring Defect Number
inferred← citeshttps://doi.org/10.20429/tag.2021.080201openalex-snapshot
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
inferred← citeshttps://doi.org/10.26493/1855-3974.1860.a3dopenalex-snapshot
An equivalent formulation of the Fan-Raspaud Conjecture and related problems
inferred← citeshttps://doi.org/10.2989/16073606.2022.2053605openalex-snapshot
A note on reducing resistance in snarks
inferred← citeshttps://doi.org/10.48550/arxiv.2008.04775openalex-snapshot
Perfect matching index vs. circular flow number of a cubic graph
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-088openalex-snapshot
Perfect-matching covers of cubic graphs with colouring defect 3
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-094openalex-snapshot
Graph covers and generalized snarks
inferred← citeshttps://doi.org/10.7151/dmgt.2204openalex-snapshot
Critical and flow-critical snarks coincide
inferred← citeshttps://doi.org/10.7151/dmgt.2467openalex-snapshot
Resistance in regular class two graphs
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.