The following pages link to (Q2857387):
Displaying 14 items.
- 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)
- 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)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) (← links)
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree (Q3461985) (← links)
- (Q5037994) (← links)
- On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) (← links)
- On the inclusion chromatic index of a graph (Q6055925) (← links)
