Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs
From MaRDI portal
Publication:1044992
DOI10.1016/j.disc.2009.04.003zbMath1179.05041OpenAlexW2034953539MaRDI QIDQ1044992
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.003
graphfractional coloringcircular coloring\(k\)-tuple edge-coloringadjacent vertex-distinguishingneighbor-distinguishing
Cites Work
- On the neighbour-distinguishing index of a graph
- The circular chromatic index of graphs of high girth
- The circular chromatic index of some Class 2 graphs
- n-tuple colorings and associated graphs
- Adjacent strong edge coloring of graphs
- General neighbour-distinguishing index of a graph
- Neighbour-distinguishing edge colourings of random regular graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- On adjacent-vertex-distinguishing total coloring of graphs
- On neighbour-distinguishing colourings from lists
- Adjacent Vertex Distinguishing Edge‐Colorings
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs