vol. 3, no. 1, pp. 1-18 (1999) Edge-Coloring and f-Coloring for Various
|
319
|
Graph Theory
– Diestel
- 1997
|
|
204
|
Graph Coloring Problems
– Jensen, Toft
- 1995
|
|
64
|
Planar Graphs: Theory and Algorithms
– Nishizeki, Chiba
- 1988
|
|
47
|
On edge coloring bipartite graphs
– Cole, Hopcroft
- 1982
|
|
44
|
Smallest-last ordering and clustering and graph coloring algorithms
– Matula, Beck
- 1983
|
|
43
|
An atlas of graphs
– Fiorini, Wilson
- 1978
|
|
43
|
A Fast Parallel Algorithm for Routing in Permutation Networks
– Lev, Pippenger, et al.
- 1981
|
|
35
|
Nash-Williams, “Edge-disjoint spanning trees of finite graphs
– A
- 1961
|
|
35
|
Scheduling File Transfers
– Coffman, Garey, et al.
- 1985
|
|
33
|
On an estimate of the chromatic class of a p-graph (in russian
– Vizing
- 1964
|
|
31
|
On the chromatic number of graphs and set systems
– Erdos, Hajnal
- 1966
|
|
22
|
An inequality for the chromatic number of a graph
– Szekeres, Wilf
- 1968
|
|
21
|
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
– Mader
- 1967
|
|
20
|
unknown title
– Vizing
- 1965
|
|
13
|
The NP-completeness of edge-colouring
– Holyer
- 1981
|
|
8
|
Relations among embedding parameters for graphs
– Dean, Hutchinson
- 1991
|
|
8
|
A min-max theorem for graphs with application to graph coloring
– Matula
- 1968
|
|
6
|
Algorithms for edge-coloring graphs
– Gabow, Nishizeki, et al.
- 1985
|
|
5
|
On a generalization of edge-coloring in graphs
– Hakimi, Kariv
- 1986
|
|
4
|
Fast algorithms for edge-coloring planar graphs
– Chrobak, Yung
- 1989
|
|
4
|
Uber graphen und iher anwendung auf determinantentheorie und mengenlehre
– König
- 1916
|
|
4
|
Edge-coloring partial k-trees
– Zhou, Nakano, et al.
- 1996
|
|
4
|
Edge-coloring and f-coloring for various classes of graphs
– Zhou, Nishizeki
- 1999
|
|
4
|
A linear algorithm for edge-coloring series-parallel multigraphs
– Zhou, Suzuki, et al.
- 1996
|
|
4
|
Fast algorithms for edge-coloring planar graphs
– Chrobak, Yung
- 1989
|
|
3
|
Improved edge-coloring algorithms for planar graphs
– Chrobak, Nishizeki
- 1990
|
|
3
|
Scheduling le transfers
– Coman, Garey, et al.
- 1985
|
|
3
|
Map color theorems
– Heawood
|
|
3
|
Approximate algorithms for the edge-coloring of graphs. Trans
– Terada, Nishizeki
- 1982
|
|
1
|
Edge coloring series parallel graphs
– Caspi, Dekel
- 1995
|
|
1
|
Algorithms for edge-coloring bipartite graphs
– Gabow, Kariv
- 1982
|
|
1
|
Some recent results in topolgical graph theory
– Kainen
- 1974
|
|
1
|
Ecient parallel algorithms for edgecoloring problems
– Karlo, Shmoys
- 1987
|
|
1
|
Scheduling transfers under port and channel constraints
– Nakano, Nishizeki
- 1993
|
|
1
|
On the f-coloring of multigraphs
– Nakano, Nishizeki, et al.
- 1988
|
|
1
|
Scheduling file transfers under port and channel constraints
– Nakano, Nishizeki
- 1993
|
|
