Pages that link to "Item:Q358639"
From MaRDI portal
The following pages link to Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639):
Displaying 24 items.
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) (← links)
- Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← 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)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← 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)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- Inclusion total chromatic number (Q2037565) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (Q2186285) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree (Q3461985) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- (Q5037994) (← links)
- On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) (← links)
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs (Q5963657) (← links)
- On the inclusion chromatic index of a graph (Q6055925) (← links)
- Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)