scientific article; zbMATH DE number 3889546

From MaRDI portal
Publication:3222860





[For the entire collection see Zbl 0547.00011.] A quadratic edge-coloring algorithm is described, which for a given multigraph constructs a minimal coloring, unless the number of colors used does not exceed \((9/8)\rho +3/4\), where \(\rho\) is the maximum degree of a vertex.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222860)