Distant set distinguishing total colourings of graphs
From MaRDI portal
Publication:2629496
zbMath1339.05147arXiv1508.05834MaRDI QIDQ2629496
Publication date: 6 July 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05834
adjacent vertex distinguishing total chromatic number\(d\)-strong total chromatic number\(r\)-adjacent strong total chromatic number\(r\)-distant set distinguishing total numbertotal neighbour distinguishing indexZhang's conjecture
Related Items
Cites Work
- Unnamed Item
- 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
- The adjacent vertex distinguishing total chromatic number
- \(r\)-strong edge colorings of graphs
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- A bound on the total chromatic number
- Adjacent strong edge coloring of graphs
- Distant set distinguishing edge colourings of graphs
- On the total-neighbor-distinguishing index by sums
- \(d\)-strong total colorings of graphs
- \(d\)-strong edge colorings of graphs
- The adjacent vertex distinguishing total coloring of planar graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- A survey on the distance-colouring of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- On adjacent-vertex-distinguishing total coloring of graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength 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
- Adjacent Vertex Distinguishing Edge‐Colorings
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Graph colouring and the probabilistic method
