On the neighbour-distinguishing index of a graph
From MaRDI portal
(Redirected from Publication:855303)
Recommendations
Cites work
- scientific article; zbMATH DE number 844141 (Why is no real title available?)
- scientific article; zbMATH DE number 907924 (Why is no real title available?)
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
- Adjacent strong edge coloring of graphs
- Asymptotic behaviour of the observability of \(Q_ n\)
- On the vertex-distinguishing proper edge-colorings of graphs
- Strong edge colorings of graphs
- Total colouring regular bipartite graphs is NP-hard
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing edge colorings of graphs
- Vertex-distinguishing proper edge-colorings
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
Cited in
(52)- Minimum number of palettes in edge colorings
- 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
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Neighbor sum distinguishing index of 2-degenerate graphs
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- Neighbor sum distinguishing index of K₄-minor free graphs
- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
- On defected colourings of graphs
- General neighbour-distinguishing index via chromatic number
- Edge-colorings of 4-regular graphs with the minimum number of palettes
- On the neighbor-distinguishing indices of planar graphs
- An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
- On distance-defined neighbor-distinguishing sets in graphs
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Edge colorings of the direct product of two graphs
- On Neighbor-Distinguishing Index of Planar Graphs
- Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
- Local neighbor-distinguishing index of graphs
- Gap-neighbour-distinguishing colourings
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
- Neighbor sum distinguishing coloring of some graphs
- Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- General neighbour-distinguishing index of a graph
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with =9, 10, or 11
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- On neighbour-distinguishing colourings from lists
- Equitable total coloring of C_m 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
- Edge-partitions of graphs and their neighbor-distinguishing index
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs
- Edge-distinguishing index of a graph
- Some bounds on the neighbor-distinguishing index of graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- 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
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
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)
