Optimal edge coloring of large graphs

DOI10.1002/(SICI)1097-0037(199908)34:1%3C61::AID-NET6%3E3.0.CO;2-GMaRDI QIDQ4262695zbMATH OpenOpenAlexFDO

Authors

Publication date 22 September 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199908)34:1%3C61::aid-net6%3E3.0.co;2-g

zbMATH Keywords

chromatic indexcompound graphsedge coloringinterconnection networkslarge graphspacket radio networks

Mathematics Subject Classification ID

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

Recommendations

• Maximum edge-colorings of graphs
• Edge coloring graphs with large minimum degree
• scientific article; zbMATH DE number 1947051
• Maximal edge-colorings of graphs
• Approximation algorithm for maximum edge coloring
• Optimal edge-coloring with edge rate constraints
• Edge-colouring of regular graphs of large degree
• Approximating the max edge-coloring problem
• Approximation Algorithms for Maximum Edge Coloring Problem
• Approximating the max-edge-coloring problem

Cites work

• Algebraic Graph Theory
• scientific article; zbMATH DE number 861410 (Why is no real title available?)
• Minimal Regular Graphs of Girths Eight and Twelve

Cited in

(2)

• Optimal Acyclic Edge Colouring of Grid Like Graphs
• Optimal acyclic edge colouring of grid like graphs

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

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