Optimal edge coloring of large graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199908)34:1<61::AID-NET6>3.0.CO;2-G" /><61::AID-NET6>3.0.CO;2-G 10.1002/(SICI)1097-0037(199908)34:1<61::AID-NET6>3.0.CO;2-GzbMath0959.90012OpenAlexW2054665230MaRDI QIDQ4262695

No author found.

Publication date: 22 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199908)34:1<61::aid-net6>3.0.co;2-g

zbMATH Keywords

edge coloringinterconnection networkschromatic indexlarge graphscompound graphspacket radio networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Algebraic Graph Theory
• Minimal Regular Graphs of Girths Eight and Twelve
• Unnamed Item

This page was built for publication: Optimal edge coloring of large graphs