Distant set distinguishing edge colourings of graphs
From MaRDI portal
Publication:1686263
DOI10.1016/J.EJC.2017.11.001zbMath1376.05060arXiv1508.05024OpenAlexW2204393909MaRDI QIDQ1686263
Publication date: 21 December 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05024
Related Items (3)
2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS ⋮ Distant set distinguishing total colourings of graphs ⋮ Distant sum distinguishing index of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neighbor sum distinguishing index
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
- Distant irregularity strength of graphs
- Colouring graphs when the number of colours is almost the maximum degree
- \(r\)-strong edge colorings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Adjacent strong edge coloring of graphs
- Edge weights and vertex colours
- \(d\)-strong edge colorings of graphs
- A survey on the distance-colouring of graphs
- Vertex colouring edge partitions
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Moore graphs and beyond: a survey of the degree/diameter problem
- Distant set distinguishing total colourings of graphs
- Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- Irregular Assignments of Trees and Forests
- A Tight Bound on the Irregularity Strength of Graphs
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- Graph colouring and the probabilistic method
This page was built for publication: Distant set distinguishing edge colourings of graphs
