Pages that link to "Item:Q2292141"
From MaRDI portal
The following pages link to Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141):
Displaying 3 items.
- A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)