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.
2013
2013
Efficient link scheduling for rechargeable wireless ad hoc and sensor networks
We study the link scheduling for rechargeable wireless ad hoc and sensor networks to improve network throughput. Efficient link… 
2010
2010
Compact Wakeup Scheduling in Wireless Sensor Networks
  • Junchao MaW. Lou
  • IEEE Global Telecommunications Conference…
  • 2010
  • Corpus ID: 2721724
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy… 
2010
2010
A Kind of Graph Structure on Von-Neumann Regular Rings 1
A kind of graph structure of a ring R can be defined as the undirected graph ΓN (R) that two nonzero elements x and y of R are… 
2004
2004
On The Adjacent Strong Edge Coloring of θ-Graph
The θ-graph is a 2-connected simple graph consisting of 3 internally disjoint paths between a pair of vertices of degree 3… 
2003
2003
The strong chromatic index of cubic Halin graphs
Review
2002
Review
2002
Strategies for multigraph edge coloring
n mathematical graph theory, coloring problems are ubiquitous. Dating back to the famous four-color map problem, both the theory… 
2001
2001
On the Chromatic Index of a Multigraph
In this paper, we have proved two theorems of chromatic index of multigraph by using Ehrenfeucht's two lemma. 
1998
1998
Edge coloring, polyhedra and probability
Edge Coloring is the following optimization problem: Given a graph, how many colors are required to color its edges in such a way… 
1993
1993
Edge-Chromatic Scheduling with Simultaneity Constraints
Reference ROSE-ARTICLE-1993-001View record in Web of Science Record created on 2006-08-16, modified on 2016-08-08 
1991
1991
Decomposing graphs into forests of paths with size less than three
A forest in which every component is path is caned a path forest. A family of path forests whose edge sets form a partition of…