On the neighbour-distinguishing index of a graph
From MaRDI portal
Publication:855303
DOI10.1007/s00373-006-0671-2zbMath1107.05032OpenAlexW2084488169MaRDI QIDQ855303
Mirko Horňák, Mariusz Woźniak, Keith J. Edwards
Publication date: 5 January 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0671-2
Related Items (41)
Edge-colorings of 4-regular graphs with the minimum number of palettes ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A note on the neighbour-distinguishing index of digraphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Neighbor sum distinguishing index ⋮ Complexity of the improper twin edge coloring of graphs ⋮ Vertex-distinguishing edge colorings of graphs with degree sum conditions ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ Neighbor sum distinguishing index of planar graphs ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ On defected colourings of graphs ⋮ \(d\)-strong edge colorings of graphs ⋮ Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs ⋮ Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) ⋮ Adjacent vertex distinguishing indices of planar graphs without 3-cycles ⋮ Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five ⋮ NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ General neighbour-distinguishing index of a graph ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ On the adjacent vertex distinguishing edge colourings of graphs ⋮ General neighbour-distinguishing index via chromatic number ⋮ Minimum number of palettes in edge colorings ⋮ Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ Equitable total coloring of \(C_m\square C_n\) ⋮ On Neighbor-Distinguishing Index of Planar Graphs ⋮ Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ Edge colorings of the direct product of two graphs ⋮ Neighbor sum distinguishing edge colorings of sparse graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Strong edge colorings of graphs
- On the vertex-distinguishing proper edge-colorings of graphs
- Total colouring regular bipartite graphs is NP-hard
- Asymptotic behaviour of the observability of \(Q_ n\)
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Vertex-distinguishing proper edge-colorings
- Vertex-distinguishing edge colorings of graphs
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
This page was built for publication: On the neighbour-distinguishing index of a graph
