Pages that link to "Item:Q2182186"

The following pages link to Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186):

Displayed 6 items.

• Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) ‎ (← links)
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) ‎ (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) ‎ (← links)
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) ‎ (← links)
• On generalized neighbor sum distinguishing index of planar graphs (Q5083874) ‎ (← links)
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) ‎ (← links)