Title of article
An application of matching theory of edge-colourings
Author/Authors
Richard P. Anstee، نويسنده , , Jerrold R. Griggs، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
253
To page
256
Abstract
An edge-colouring algorithm that uses no colour interchanges is described that achieves Shannonʹs bound, χ′(G) ⩽ ⌊32Δ(G)⌋, for any loopless multigraph G. Also, a counterexample is presented to an edge-colouring conjecture from the matching theory text of Lovász and Plummer.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943907
Link To Document