Bounding the strong chromatic index of dense random graphs

DOI10.1016/J.DISC.2003.09.009zbMath1044.05062OpenAlexW1967598767MaRDI QIDQ1827703

Brendan Nagle, Andrzej Czygrinow

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.09.009

zbMATH Keywords

random graphsstrong chromatic index

Mathematics Subject Classification ID

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

Related Items (3)

Strong edge colorings of uniform graphs ⋮ Distance edge-colourings and matchings ⋮ On distance edge-colourings and matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong edge colorings of uniform graphs
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• The chromatic number of random graphs

This page was built for publication: Bounding the strong chromatic index of dense random graphs