
Edge coloring
Packing T-joins ★★
Author(s): DeVos






Acyclic edge-colouring ★★
Author(s): Fiamcik


Keywords: edge-coloring
A generalization of Vizing's Theorem? ★★
Author(s): Rosenfeld






Keywords: edge-coloring; hypergraph; Vizing
List colorings of edge-critical graphs ★★
Author(s): Mohar








Keywords: edge-coloring; list coloring
Universal Steiner triple systems ★★
Author(s): Grannell; Griggs; Knor; Skoviera
Keywords: cubic graph; Steiner triple system
Edge list coloring conjecture ★★★
Author(s):



Keywords:
Seymour's r-graph conjecture ★★★
Author(s): Seymour
An -graph is an
-regular graph
with the property that
for every
with odd size.



Keywords: edge-coloring; r-graph
Goldberg's conjecture ★★★
Author(s): Goldberg
The overfull parameter is defined as follows:


Keywords: edge-coloring; multigraph
Strong edge colouring conjecture ★★
A strong edge-colouring of a graph is a edge-colouring in which every colour class is an induced matching; that is, any two vertices belonging to distinct edges with the same colour are not adjacent. The strong chromatic index
is the minimum number of colours in a strong edge-colouring of
.


Keywords:
