Gap vertex-distinguishing edge colorings of graphs

DOI10.1016/J.DISC.2012.06.019MaRDI QIDQ456892zbMATH OpenOpenAlexFDO

Authors M. A. Tahraoui, E. Duchêne, H. 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)

Recommendations

• Gap-neighbour-distinguishing colourings
• Local gap colorings from edge labelings
• New estimates for the gap chromatic number
• On gap-labellings of some families of graphs
• On the vertex distinguishing equitable edge-coloring of graphs

Cites work

• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 140040 (Why is no real title available?)
• scientific article; zbMATH DE number 841572 (Why is no real title available?)
• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• scientific article; zbMATH DE number 3895095 (Why is no real title available?)
• scientific article; zbMATH DE number 4193700 (Why is no real title available?)
• scientific article; zbMATH DE number 5054146 (Why is no real title available?)
• Graph theory
• Localization of jumps of the point-distinguishing chromatic index of K_{n,n}
• Multiplicative vertex-colouring weightings of graphs
• On detectable factorizations of cubic graphs
• On the point-distinguishing chromatic index of complete bipartite graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• The irregular coloring number of a tree
• The irregularity strength of circulant graphs
• Vertex-distinguishing proper edge-colorings

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456892)