Pages that link to "Item:Q2182186"
From MaRDI portal
The following pages link to Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186):
Displaying 11 items.
- Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
- Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
- 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)
- \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898) (← links)
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← 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)
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs (Q6585249) (← links)
