On coloring problems for two-season multigraphs

DOI10.1134/S1990478915020155MaRDI QIDQ3186821zbMATH OpenFDO

Authors V. G. Vizing

Publication date 12 August 2016

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1990478915020155

zbMATH Keywords

two-season coloringtwo-season multigraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge-coloring of multigraphs
• The edge chromatic number of a directed/mixed multigraph
• scientific article; zbMATH DE number 1998816
• On the fg-coloring of graphs
• A better than “best possible” algorithm to edge color multigraphs

Cites work

• Some simplified NP-complete graph problems

Cited in

(1)

• Sliding window temporal graph coloring

This page was built for publication: On coloring problems for two-season multigraphs

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