Gap vertex-distinguishing edge colorings of graphs

DOI10.1016/J.DISC.2012.06.019zbMath1252.05071OpenAlexW2069738272MaRDI QIDQ456892

Eric Duchêne, Mohammed Amin Tahraoui, Hamamache Kheddouci

Publication date: 16 October 2012

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

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

zbMATH Keywords

edge coloringvertex labelinggap chromatic numbergap vertex-distinguishing edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

On the complexity of gap-\([2\)-vertex-labellings of subcubic bipartite graphs] ⋮ On strongly planar not-all-equal 3SAT ⋮ A Vizing-like theorem for union vertex-distinguishing edge coloring ⋮ Algorithmic complexity of proper labeling problems ⋮ On gap-labellings of some families of graphs ⋮ Graphs without gap-vertex-labellings: families and bounds ⋮ New estimates for the gap chromatic number ⋮ A note on edge weightings inducing proper vertex colorings

Cites Work

• Multiplicative vertex-colouring weightings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• The irregular coloring number of a tree
• The irregularity strength of circulant graphs
• Localization of jumps of the point-distinguishing chromatic index of K_{n,n}
• Vertex-distinguishing proper edge-colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gap vertex-distinguishing edge colorings of graphs