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.
2011
2011
Snarks with given real flow numbers
We show that for each rational number r such that 4 
2004
2004
An experimental study of a simple, distributed edge-coloring algorithm
We conduct an experimental analysis of a distributed randomized algorithm for edge coloring simple undirected graphs. The… 
2003
2003
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., <b>20</b>, 1991) conjectured that the minimum number <i>m</i>(<i>n, r</i>) of middle-state… 
2003
2003
Determining the chromatic index of music
Musical diachrony and synchrony have revealed an incredible variation in musical scales, many of which are implied, lurking in… 
1998
1998
Martingales and Locality in Distributed Computing
We use Martingale inequalities to give a simple and uniform analysis of two families of distributed randomised algorithms for… 
1996
1996
Parallel Edge Coloring Approximation
Let G be a graph with n vertices and m edges and let its maximum degree be Δ. It is shown that a valid edge coloring of G using… 
Review
1995
Review
1995
Edge-Coloring Algorithms
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like… 
1990
1990
An upper bound for the total chromatic number
  • H. Hind
  • Graphs Comb.
  • 1990
  • Corpus ID: 14684268
AbstractThe total chromatic number,χ″(G), of a graphG, is defined to be the minimum number of colours needed to colour the… 
1990
1990
Interconnect optimisation during data path allocation
  • L. Stok
  • Proceedings of the European Design Automation…
  • 1990
  • Corpus ID: 24861131
In previous research interconnection was optimised when the module allocation for the operations and the register allocation for… 
1976
1976
On small graphs critical with respect to edge colourings
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)