Pages that link to "Item:Q489739"
From MaRDI portal
The following pages link to Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five (Q489739):
Displaying 14 items.
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) (← links)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (Q2186285) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
- Distinguishing colorings of 3-connected planar graphs with five colors (Q2799604) (← links)
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four (Q2858736) (← links)
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six (Q3092678) (← links)
- (Q4604121) (← links)
- (Q5037994) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) (← links)
- Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)