Skip to search formSkip to main contentSkip to account menu

Edge coloring

Known as: Edge chromatic number, K-edge colorable, Edge colouring 
In graph theory, an edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two adjacent edges have the same color… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
APXAcyclic coloringAnthony HiltonAperiodic graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Graph Coloring Algorithms
A coloring of a graph is an assignment of labels to certain elements of a graph. More commonly, elements are either vertices… 
Highly Cited
2006
Highly Cited
2006
Strong edge coloring for channel assignment in wireless radio networks
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks… 
Highly Cited
1996
Highly Cited
1996
Asymptotically Good List-Colorings
Thelist-chromatic index,?l?(H), of a hypergraph H is the leasttsuch that for any assignment oft-setsS(A) to the edgesAof H, there… 
Highly Cited
1992
Highly Cited
1992
Some upper bounds on the total and list chromatic numbers of multigraphs
In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we… 
Highly Cited
1990
Highly Cited
1990
Polynomial algorithms for graph isomorphism and chromatic index on partial k -trees
1990
1990
Extending an edge-coloring
When can a k-edge-coloring of a subgraph K of a graph G be extended to a k-edge-coloring of G? One necessary condition is that… 
Highly Cited
1990
Highly Cited
1990
On the 1.1 Edge-Coloring of Multigraphs
A new upper bound is proved for the chromatic index $q^* ( G )$ of multigraphs $G = ( V,E )$. Let $d ( G )$ be the maximum degree… 
Highly Cited
1986
Highly Cited
1986
A generalization of edge-coloring in graphs
Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each… 
Highly Cited
1983
Highly Cited
1983
On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems
For n ≧ k ≧ 3, let f(n,Ck) denote the maximum number m for which it is possible to color the edges of the complete graph Kn with… 
Highly Cited
1980
Highly Cited
1980
On Edge Coloring Bipartite Graphs
The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)