-
1
-
-
0031280748
-
List edge and list total colouring of multigraphs
-
O.V. Borodin, A.V. Kostochka, and D.R. Woodall, "List edge and list total colouring of multigraphs," J. Combinatorial Theory, Series B, vol.71, pp.184-204, 1997.
-
(1997)
J. Combinatorial Theory, Series B
, vol.71
, pp. 184-204
-
-
Borodin, O.V.1
Kostochka, A.V.2
Woodall, D.R.3
-
2
-
-
0003677229
-
-
Springer-verlag, New York
-
R. Diestel, Graph Theory, Springer-verlag, New York, 1997.
-
(1997)
Graph Theory
-
-
Diestel, R.1
-
3
-
-
0038719249
-
Linear algorithm for finding list edge-colorings of series-parallel graphs
-
Feb.
-
T. Fujino, S. Isobe, X. Zhou, and T. Nishizeki, "Linear algorithm for finding list edge-colorings of series-parallel graphs," IEICE Trans. Inf. & Syst., vol.E86-D, no.2, pp.186-190, Feb. 2003.
-
(2003)
IEICE Trans. Inf. & Syst.
, vol.E86-D
, Issue.2
, pp. 186-190
-
-
Fujino, T.1
Isobe, S.2
Zhou, X.3
Nishizeki, T.4
-
4
-
-
0001223187
-
The list chromatic index of a bipartite multigraph
-
F. Galvin, "The list chromatic index of a bipartite multigraph," J. Combinatorial Theory, Series B, vol.63, pp.153-158, 1995.
-
(1995)
J. Combinatorial Theory, Series B
, vol.63
, pp. 153-158
-
-
Galvin, F.1
-
5
-
-
0000429528
-
The NP-completeness of edge-coloring
-
I. Holyer, "The NP-completeness of edge-coloring," SIAM J. Comput., vol.10, no.4, pp.718-720, 1981.
-
(1981)
SIAM J. Comput.
, vol.10
, Issue.4
, pp. 718-720
-
-
Holyer, I.1
-
6
-
-
0038582060
-
List edge-colorings of series-parallel graphs
-
M. Juvan, B. Mohar, and R. Thomas, "List edge-colorings of series-parallel graphs," The Electronic Journal of Combinatorics, vol.6, pp.1-6, 1999.
-
(1999)
The Electronic Journal of Combinatorics
, vol.6
, pp. 1-6
-
-
Juvan, M.1
Mohar, B.2
Thomas, R.3
-
7
-
-
34250966677
-
Über Graphen und ihre Anwendung auf Determinententheorie und Mengenlehre
-
D. König, "Über Graphen und ihre Anwendung auf Determinententheorie und Mengenlehre," Math. Annalen, vol.77, pp.453-465, 1916.
-
(1916)
Math. Annalen
, vol.77
, pp. 453-465
-
-
König, D.1
-
9
-
-
0346273573
-
Approximate algorithms for the edge-coloring of graphs
-
Nov.
-
O. Terada and T. Nishizeki, "Approximate algorithms for the edge-coloring of graphs," IECE Trans. Inf. & Syst. (Japanese Edition), vol.J65-D, no.11, pp.1382-1389, Nov. 1982.
-
(1982)
IECE Trans. Inf. & Syst. (Japanese Edition)
, vol.J65-D
, Issue.11
, pp. 1382-1389
-
-
Terada, O.1
Nishizeki, T.2
-
10
-
-
0002935868
-
On an estimate of the chromatic class of a p-graph
-
in Russian
-
V.G. Vizing, "On an estimate of the chromatic class of a p-graph," Diskret Analiz, 3, pp.25-30, 1964 (in Russian).
-
(1964)
Diskret Analiz
, vol.3
, pp. 25-30
-
-
Vizing, V.G.1
-
11
-
-
0037567785
-
List edge-colouring of series-parallel graphs
-
in Chinese
-
J.L. Wu, "List edge-colouring of series-parallel graphs," Shandong Daxue Xuebao Ziran Kexue Ban, vol.35, no.2, pp.144-149, 2000 (in Chinese).
-
(2000)
Shandong Daxue Xuebao Ziran Kexue Ban
, vol.35
, Issue.2
, pp. 144-149
-
-
Wu, J.L.1
|