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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1948-2017
05010015019482016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider both the vertex and the edge versions of three graph partitioning problems. These problems are dominating set, list-q… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
For a graph G(V, E), if a proper k-edge coloring f is satisfied with C(u) # C(V) for UZ) E E(G), where C(u) = {f(~v) 1 UZI E E… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic… (More)
Is this relevant?
2000
2000
Given a bipartite graph G with n nodes, m edges and maximum degree ∆, we find an edge coloring for G using ∆ colors in time T +O… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Certain types of routing, scheduling, and resource-allocation problems in a distributed setting can be modeled as edge-coloring… (More)
Is this relevant?
1996
1996
Ž Many combinatorial problems can be efficiently solved for partial k-trees graphs . of treewidth bounded by k . The edge… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1982
Highly Cited
1982
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… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?