The Strong Chromatic Index of Random Graphs

DOI10.1137/S0895480104445757zbMath1093.05064OpenAlexW2088103653WikidataQ56390651 ScholiaQ56390651MaRDI QIDQ5470789

Michael Krivelevich, Alan M. Frieze, Benjamin Sudakov

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480104445757

zbMATH Keywords

random graphsstrong chromatic index

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Distance edge-colourings and matchings ⋮ Strong cliques in claw-free graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ On distance edge-colourings and matchings ⋮ Rainbow matchings in strongly edge-colored graphs

This page was built for publication: The Strong Chromatic Index of Random Graphs