The edge chromatic number of a directed/mixed multigraph
From MaRDI portal
Publication:4261182
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.05039MaRDI 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
edge coloring; polynomial algorithm; sink; source; maximum degree; edge chromatic number; mixed multigraph
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, On (1,l)-coloring of incidentors of multigraphs, A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job, The Laplacian spectrum of a mixed graph, On spectral integral variations of mixed graphs, Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\), The incidentor coloring of multigraphs and its applications, Largest eigenvalue of a unicyclic mixed graphs, The Laplacian eigenvalues of mixed graphs, First eigenvalue of nonsingular mixed graphs with given number of pendant vertices, A complete 4-parametric complexity classification of short shop scheduling problems, Complete Complexity Classification of Short Shop Scheduling, On eigenvectors of mixed graphs with exactly one nonsingular cycle
Cites Work
