Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,768 papers from all fields of science
Search
Sign In
Create Free Account
Edge coloring
Known as:
Edge chromatic number
, K-edge colorable
, Edge colouring
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
APX
Acyclic coloring
Anthony Hilton
Aperiodic graph
Expand
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
Guodong Sun
,
Guofu Qiao
,
Lin Zhao
EURASIP Journal on Wireless Communications and…
2013
Corpus ID: 14331895
We study the link scheduling for rechargeable wireless ad hoc and sensor networks to improve network throughput. Efficient link…
Expand
2010
2010
Compact Wakeup Scheduling in Wireless Sensor Networks
Junchao Ma
,
Wei 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…
Expand
2010
2010
Some graph classes satisfying acyclic edge colouring conjecture
Rahul Muthu
,
N. Narayanan
,
C. Subramanian
2010
Corpus ID: 17744273
We present some classes of graphs which satisfy the acyclic edge colouring conjecture which states that any graph can be…
Expand
2010
2010
A Kind of Graph Structure on Von-Neumann Regular Rings 1
Ai-Hua Li
,
Qi-sheng Li
2010
Corpus ID: 54697064
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…
Expand
2008
2008
Acyclic Edge Colouring of Partial 2-Trees
Rahul Muthu
,
N. Narayanan
,
C. Subramanian
2008
Corpus ID: 16586798
An acyclic edge colouringof a graph is a proper edge colouring such that there are no bic hromatic cycles. Theacyclic chromatic…
Expand
2004
2004
On The Adjacent Strong Edge Coloring of θ-Graph
Wen-Jie Wang
2004
Corpus ID: 125027653
The θ-graph is a 2-connected simple graph consisting of 3 internally disjoint paths between a pair of vertices of degree 3…
Expand
2003
2003
The strong chromatic index of cubic Halin graphs
Wing-Ka Tam
2003
Corpus ID: 125112739
2000
2000
On The Adjacent Strong Edge Coloring of 1-Tree
Zhong-Fu Zhang
2000
Corpus ID: 123909759
Let G(V,E) be a graph. A k -proper edge coloring f is called a k -adjacent strong edge coloring of G(V,E) iff every uv∈ E(G…
Expand
1998
1998
Edge coloring, polyhedra and probability
Ljubomir Perković
,
B. Reed
,
D. Scott
1998
Corpus ID: 117583442
Edge Coloring is the following optimization problem: Given a graph, how many colors are required to color its edges in such a way…
Expand
1991
1991
Decomposing graphs into forests of paths with size less than three
Bor-Liang Chen
,
Hung-Lin Fu
,
Kuo-Ching Huang
The Australasian Journal of Combinatorics
1991
Corpus ID: 29803846
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…
Expand