Pages that link to "Item:Q2631097"

The following pages link to Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097):

Displaying 15 items.

• Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← links)
• Neighbor sum distinguishing total choosability of cubic graphs (Q2227993) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
• Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272) (← links)
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
• Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← links)
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)