Pages that link to "Item:Q1698052"

The following pages link to The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052):

Displaying 11 items.

• On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) (← links)
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
• Bounds on neighborhood total domination number in graphs (Q2321595) (← links)
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
• Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
• Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)