Pages that link to "Item:Q2219970"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970):
Displaying 3 items.
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
- On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)
