Strong edge colorings of uniform graphs
From MaRDI portal
Publication:1887640
DOI10.1016/J.DISC.2004.04.011zbMath1059.05047OpenAlexW2104919312MaRDI QIDQ1887640
Brendan Nagle, Andrzej Czygrinow
Publication date: 22 November 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.04.011
Related Items (2)
Bounding the strong chromatic index of dense random graphs ⋮ Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- On universality of graphs with uniformly distributed edges
- Perfect matchings in \(\varepsilon\)-regular graphs
- On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
- Bounding the strong chromatic index of dense random graphs
- Strong chromatic index of subset graphs
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
This page was built for publication: Strong edge colorings of uniform graphs