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)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Mohsen Ghaffari, Hsin-Hao Su
- SODA
- 2017

We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking theâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Shashidhar Gandham, Milind Dawande, Ravi Prakash
- Proceedings IEEE 24th Annual Joint Conference ofâ€¦
- 2005

We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithmâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Daniel Kobler, Udi Rotics
- Discrete Applied Mathematics
- 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

- Zhongfu Zhang, Linzhong Liu, Jianfang Wang
- Appl. Math. Lett.
- 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

- Noga Alon, Benny Sudakov, Ayal Zaks
- Journal of Graph Theory
- 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

- Ajai Kapoor, Romeo Rizzi
- J. Algorithms
- 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

- Alessandro Panconesi, Aravind Srinivasan
- SIAM J. Comput.
- 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

- Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
- J. Algorithms
- 1996

Å½ Many combinatorial problems can be efficiently solved for partial k-trees graphs . of treewidth bounded by k . The edgeâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Richard B Cole, John E. Hopcroft
- SIAM J. Comput.
- 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

- Ian Holyer
- SIAM J. Comput.
- 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)

Is this relevant?