On the public citation graph

Some remarks on the chromatic index of a graph

https://doi.org/10.1007/bf01228237
0 signed · 32 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.1016/0012-365x(73)90023-xopenalex-snapshot
On the edge-chromatic number of a graph
inferredcites →https://doi.org/10.1515/crll.1964.214-215.43openalex-snapshot
On the structure of 5- and 6-chromatic abstract graphs.
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(200004)33:4<240::aid-jgt5>3.0.co;2-ropenalex-snapshot
Chromatic-index critical multigraphs of order 20
inferred← citeshttps://doi.org/10.1002/jgt.22116openalex-snapshot
Subcubic Edge‐Chromatic Critical Graphs Have Many Edges
inferred← citeshttps://doi.org/10.1002/jgt.22423openalex-snapshot
The average degree of a subcubic edge‐chromatic critical graph
inferred← citeshttps://doi.org/10.1002/jgt.3190010112openalex-snapshot
Definitions of criticality with respect to edge‐coloring
inferred← citeshttps://doi.org/10.1002/jgt.3190020202openalex-snapshot
A bibliographic survey of edge‐colorings
inferred← citeshttps://doi.org/10.1002/jgt.3190020310openalex-snapshot
Counterexamples to two conjectures of Hilton
inferred← citeshttps://doi.org/10.1002/jgt.3190040309openalex-snapshot
On the critical graph conjecture
inferred← citeshttps://doi.org/10.1002/jgt.3190080115openalex-snapshot
Edge‐coloring of multigraphs: Recoloring technique
inferred← citeshttps://doi.org/10.1002/jgt.3190080403openalex-snapshot
The chromatic index of graphs of even order with many edges
inferred← citeshttps://doi.org/10.1002/jgt.3190170104openalex-snapshot
Edge‐chromatic critical graphs and the existence of 1‐factors
inferred← citeshttps://doi.org/10.1007/bfb0070415openalex-snapshot
Edge-colorings of graphs — A survey
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90009-0openalex-snapshot
On critical graphs with chromatic index 4
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90139-4openalex-snapshot
On small graphs critical with respect to edge colourings
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90074-2openalex-snapshot
The chromatic index of graphs with large maximum degree
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90030-7openalex-snapshot
Construction of class 2 graphs with maximum vertex degree 3
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.010openalex-snapshot
Chromatic-index-critical graphs of orders 13 and 14
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.048openalex-snapshot
The average degree of an edge-chromatic critical graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.01.006openalex-snapshot
Chromatic index determined by fractional chromatic index
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.03.004openalex-snapshot
Structural properties of edge-chromatic critical multigraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70483-7openalex-snapshot
Construction of Critical Graphs by Replacing Edges
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.008openalex-snapshot
Edge-colourings
inferred← citeshttps://doi.org/10.1017/s030500410005129xopenalex-snapshot
Some remarks on a paper by Vizing on critical graphs
inferred← citeshttps://doi.org/10.1017/s0305004100067244openalex-snapshot
Graphs which are vertex-critical with respect to the edge-chromatic number
inferred← citeshttps://doi.org/10.1080/00029890.1976.11994058openalex-snapshot
Three Conjectures on Critical Graphs
inferred← citeshttps://doi.org/10.1109/pdcat.2009.71openalex-snapshot
A Self-Stabilizing (Δ+ 1)- Edge-Coloring Algorithm of Arbitrary Graphs
inferred← citeshttps://doi.org/10.37236/6848openalex-snapshot
Measures of Edge-Uncolorability of Cubic Graphs
inferred← citeshttps://doi.org/10.47443/dml.2021.s105openalex-snapshot
A brief history of edge-colorings – with personal reminiscences
inferred← citeshttps://doi.org/10.48550/arxiv.1507.05600openalex-snapshot
Edge-coloring via fixable subgraphs
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
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.