Pages that link to "Item:Q947049"
From MaRDI portal
The following pages link to Adjacent vertex distinguishing total coloring of graphs with lower average degree (Q947049):
Displaying 13 items.
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← links)
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)
- Neighbor sum distinguishing total colorings of corona of subcubic graphs (Q2045233) (← links)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← links)
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) (← links)
- (Q3384719) (← links)
- Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree (Q6121343) (← links)