Arbitrarily large difference between d-strong chromatic index and its trivial lower bound
From MaRDI portal
Publication:383771
DOI10.1016/J.DISC.2013.01.026zbMATH Open1277.05069OpenAlexW2057473864MaRDI QIDQ383771FDOQ383771
Authors: Martina Mockovčiaková, Roman Soták 
Publication date: 6 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.01.026
Recommendations
Cites Work
- Adjacent strong edge coloring of graphs
- Vertex-distinguishing proper edge-colorings
- On the vertex-distinguishing proper edge-colorings of graphs
- \(d\)-strong edge colorings of graphs
- Title not available (Why is that?)
- \(r\)-strong edge colorings of graphs
- Vertex-distinguishing proper edge colourings of some regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
- Strong edge colorings of graphs
- Vertex-distinguishing edge colorings of graphs
- Title not available (Why is that?)
- Asymptotic behaviour of the observability of \(Q_ n\)
Cited In (6)
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- Distant set distinguishing edge colourings of graphs
- \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\)
- \(d\)-strong total colorings of graphs
- \(d\)-strong edge colorings of graphs
- Distant set distinguishing total colourings of graphs
This page was built for publication: Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383771)
