Plantholt, Michael Overfull conjecture for graphs with high minimum degree. (English) Zbl 1055.05063 J. Graph Theory 47, No. 2, 73-80 (2004). MSC: 05C15 05C70 05C35 PDFBibTeX XMLCite \textit{M. Plantholt}, J. Graph Theory 47, No. 2, 73--80 (2004; Zbl 1055.05063) Full Text: DOI
Czygrinow, Andrzej; Nagle, Brendan Strong edge colorings of uniform graphs. (English) Zbl 1059.05047 Discrete Math. 286, No. 3, 219-223 (2004). Reviewer: Van Bang Le (Rostock) MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{A. Czygrinow} and \textit{B. Nagle}, Discrete Math. 286, No. 3, 219--223 (2004; Zbl 1059.05047) Full Text: DOI
Erdös, Peter L.; Faigle, Ulrich; Hochstättler, Winfried; Kern, Walter Note on the game chromatic index of trees. (English) Zbl 1066.91015 Theor. Comput. Sci. 313, No. 3, 371-376 (2004). MSC: 91A43 05C15 91A46 PDFBibTeX XMLCite \textit{P. L. Erdös} et al., Theor. Comput. Sci. 313, No. 3, 371--376 (2004; Zbl 1066.91015) Full Text: DOI Link
Hackmann, Andrea; Kemnitz, Arnfried The circular chromatic index. (English) Zbl 1055.05052 Discrete Math. 286, No. 1-2, 89-93 (2004). Reviewer: Tomáš Madaras (Košice) MSC: 05C15 PDFBibTeX XMLCite \textit{A. Hackmann} and \textit{A. Kemnitz}, Discrete Math. 286, No. 1--2, 89--93 (2004; Zbl 1055.05052) Full Text: DOI
Kaiser, Tomáš; Král’, Daniel; Škrekovski, Riste A revival of the girth conjecture. (English) Zbl 1052.05030 J. Comb. Theory, Ser. B 92, No. 1, 41-53 (2004). MSC: 05C15 PDFBibTeX XMLCite \textit{T. Kaiser} et al., J. Comb. Theory, Ser. B 92, No. 1, 41--53 (2004; Zbl 1052.05030) Full Text: DOI
Vizing, V. G. Factor edge colouring of a multigraph. (Russian) Zbl 1045.05045 Diskretn. Anal. Issled. Oper., Ser. 1 11, No. 2, 18-31 (2004). Reviewer: O. V. Borodin (Novosibirsk) MSC: 05C15 PDFBibTeX XMLCite \textit{V. G. Vizing}, Diskretn. Anal. Issled. Oper., Ser. 1 11, No. 2, 18--31 (2004; Zbl 1045.05045)
Danziger, Peter; Mendelsohn, Eric; Quattrocchi, Gaetano On the chromatic index of path decompositions. (English) Zbl 1049.05032 Discrete Math. 284, No. 1-3, 107-121 (2004). Reviewer: A. Rosa (Hamilton/Ontario) MSC: 05C15 05B30 PDFBibTeX XMLCite \textit{P. Danziger} et al., Discrete Math. 284, No. 1--3, 107--121 (2004; Zbl 1049.05032) Full Text: DOI
Czygrinow, Andrzej; Nagle, Brendan Bounding the strong chromatic index of dense random graphs. (English) Zbl 1044.05062 Discrete Math. 281, No. 1-3, 129-136 (2004). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C15 PDFBibTeX XMLCite \textit{A. Czygrinow} and \textit{B. Nagle}, Discrete Math. 281, No. 1--3, 129--136 (2004; Zbl 1044.05062) Full Text: DOI
Steffen, Eckhard Measurements of edge-uncolorability. (English) Zbl 1041.05031 Discrete Math. 280, No. 1-3, 191-214 (2004). MSC: 05C15 PDFBibTeX XMLCite \textit{E. Steffen}, Discrete Math. 280, No. 1--3, 191--214 (2004; Zbl 1041.05031) Full Text: DOI
Zhao, Yue New lower bounds for the size of edge chromatic critical graphs. (English) Zbl 1041.05034 J. Graph Theory 46, No. 2, 81-92 (2004). MSC: 05C15 PDFBibTeX XMLCite \textit{Y. Zhao}, J. Graph Theory 46, No. 2, 81--92 (2004; Zbl 1041.05034) Full Text: DOI
Grünewald, Stefan; Steffen, Eckhard Independent sets and 2-factors in edge-chromatic-critical graphs. (English) Zbl 1033.05041 J. Graph Theory 45, No. 2, 113-118 (2004). MSC: 05C15 05C70 PDFBibTeX XMLCite \textit{S. Grünewald} and \textit{E. Steffen}, J. Graph Theory 45, No. 2, 113--118 (2004; Zbl 1033.05041) Full Text: DOI
Cameron, Kathie Induced matchings in intersection graphs. (English) Zbl 1033.05080 Discrete Math. 278, No. 1-3, 1-9 (2004). MSC: 05C70 05C62 05C85 68R10 PDFBibTeX XMLCite \textit{K. Cameron}, Discrete Math. 278, No. 1--3, 1--9 (2004; Zbl 1033.05080) Full Text: DOI