Arbitrarily large difference between d-strong chromatic index and its trivial lower bound

DOI10.1016/J.DISC.2013.01.026MaRDI QIDQ383771zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

vertex-distinguishing coloringcirculant graph\(d\)-strong chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• \(d\)-strong edge colorings of graphs
• \(d\)-strong total colorings of graphs
• \(d\)-strong total colorings of cycles when \(24\leq d\leq 34\)
• \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\)
• Strong edge chromatic index of the generalized Petersen graphs

Cites work

• scientific article; zbMATH DE number 844141 (Why is no real title available?)
• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• scientific article; zbMATH DE number 5174935 (Why is no real title available?)
• scientific article; zbMATH DE number 2204182 (Why is no real title available?)
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
• Adjacent strong edge coloring of graphs
• Asymptotic behaviour of the observability of \(Q_ n\)
• On the vertex-distinguishing proper edge-colorings of graphs
• Strong edge colorings of graphs
• Vertex-distinguishing edge colorings of graphs
• Vertex-distinguishing proper edge colourings of some regular graphs
• Vertex-distinguishing proper edge-colorings
• \(d\)-strong edge colorings of graphs
• \(r\)-strong edge colorings of graphs

Cited in

(6)

• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\)
• \(d\)-strong edge colorings of graphs
• Distant set distinguishing total colourings of graphs
• \(d\)-strong total colorings of graphs
• Distant set distinguishing edge 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)