Gap vertex-distinguishing edge colorings of graphs
From MaRDI portal
Publication:456892
DOI10.1016/J.DISC.2012.06.019zbMATH Open1252.05071OpenAlexW2069738272MaRDI QIDQ456892FDOQ456892
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
Recommendations
Cites Work
- Graph theory
- Title not available (Why is that?)
- Vertex-distinguishing proper edge-colorings
- On the vertex-distinguishing proper edge-colorings of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The irregular coloring number of a tree
- Multiplicative vertex-colouring weightings of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The irregularity strength of circulant graphs
- On the point-distinguishing chromatic index of complete bipartite graphs
- Localization of jumps of the point-distinguishing chromatic index of K_{n,n}
- Title not available (Why is that?)
- Title not available (Why is that?)
- On detectable factorizations of cubic graphs
Cited In (10)
- New estimates for the gap chromatic number
- A note on edge weightings inducing proper vertex colorings
- On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs
- On gap-labellings of some families of graphs
- Gap-neighbour-distinguishing colourings
- Graphs without gap-vertex-labellings: families and bounds
- On strongly planar not-all-equal 3SAT
- Algorithmic complexity of proper labeling problems
- Local gap colorings from edge labelings
- A Vizing-like theorem for union vertex-distinguishing edge coloring
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)
