Pages that link to "Item:Q855303"
From MaRDI portal
The following pages link to On the neighbour-distinguishing index of a graph (Q855303):
Displaying 41 items.
- Neighbor sum distinguishing index (Q367074) (← links)
- Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
- An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154) (← links)
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654) (← links)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) (← links)
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five (Q489739) (← links)
- Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
- Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs (Q654244) (← links)
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756) (← links)
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (Q726516) (← links)
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
- General neighbour-distinguishing index via chromatic number (Q973148) (← links)
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes (Q987834) (← links)
- Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← links)
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) (← links)
- Neighbor sum distinguishing index of 2-degenerate graphs (Q1680491) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← links)
- Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs (Q2341729) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- Edge colorings of the direct product of two graphs (Q2354610) (← links)
- Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754) (← links)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs (Q2438328) (← links)
- On defected colourings of graphs (Q2439252) (← links)
- \(d\)-strong edge colorings of graphs (Q2441359) (← links)
- General neighbour-distinguishing index of a graph (Q2470450) (← links)
- Edge-colorings of 4-regular graphs with the minimum number of palettes (Q2631073) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree (Q3461985) (← links)
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
- On the adjacent vertex distinguishing edge colourings of graphs (Q3568414) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
- A note on the neighbour-distinguishing index of digraphs (Q5056824) (← links)
- On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) (← links)
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs (Q5963657) (← links)