On the neighbour-distinguishing index of a graph
From MaRDI portal
Publication:855303
DOI10.1007/S00373-006-0671-2zbMATH Open1107.05032OpenAlexW2084488169MaRDI QIDQ855303FDOQ855303
Mirko Horňák, Keith Edwards, Mariusz Woźniak
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
- On the vertex-distinguishing proper edge-colorings of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
- Strong edge colorings of graphs
- Total colouring regular bipartite graphs is NP-hard
- Vertex-distinguishing edge colorings of graphs
- Asymptotic behaviour of the observability of \(Q_ n\)
Cited In (44)
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Neighbor sum distinguishing index
- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
- On defected colourings of graphs
- Neighbor sum distinguishing index of 2-degenerate graphs
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- General neighbour-distinguishing index via chromatic number
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
- Edge-colorings of 4-regular graphs with the minimum number of palettes
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- On distance-defined neighbor-distinguishing sets in graphs
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- On Neighbor-Distinguishing Index of Planar Graphs
- Edge colorings of the direct product of two graphs
- Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
- Local neighbor-distinguishing index of graphs
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
- General neighbour-distinguishing index of a graph
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)
- Equitable total coloring of \(C_m\square C_n\)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Some bounds on the neighbor-distinguishing index of graphs
- Strict neighbor-distinguishing index of subcubic graphs
- \(d\)-strong edge colorings of graphs
- On the adjacent vertex distinguishing edge colourings of graphs
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Complexity of the improper twin edge coloring of graphs
- A note on the neighbour-distinguishing index of digraphs
- Upper bounds for adjacent vertex-distinguishing edge coloring
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- Minimum number of palettes in edge colorings
Recommendations
This page was built for publication: On the neighbour-distinguishing index of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855303)