The edge chromatic number of a directed/mixed multigraph

DOI<267::AID-JGT1>3.0.CO;2-D 10.1002/(SICI)1097-0118(199908)31:4<267::AID-JGT1>3.0.CO;2-DzbMath0937.05039OpenAlexW4254376225MaRDI QIDQ4261182

V. G. Vizing, Leonid S. Mel'nikov

Publication date: 4 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199908)31:4<267::aid-jgt1>3.0.co;2-d

zbMATH Keywords

edge coloringpolynomial algorithmsinksourcemaximum degreeedge chromatic numbermixed multigraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

The incidentor coloring of multigraphs and its applications ⋮ A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job ⋮ A complete 4-parametric complexity classification of short shop scheduling problems ⋮ On spectral integral variations of mixed graphs ⋮ On (1,l)-coloring of incidentors of multigraphs ⋮ The Laplacian spectrum of a mixed graph ⋮ Largest eigenvalue of a unicyclic mixed graphs ⋮ On eigenvectors of mixed graphs with exactly one nonsingular cycle ⋮ Complete Complexity Classification of Short Shop Scheduling ⋮ Unnamed Item ⋮ Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) ⋮ The Laplacian eigenvalues of mixed graphs ⋮ First eigenvalue of nonsingular mixed graphs with given number of pendant vertices

Cites Work

• A Theorem on Coloring the Lines of a Network
• Unnamed Item
• Unnamed Item

This page was built for publication: The edge chromatic number of a directed/mixed multigraph