Pages that link to "Item:Q3179898"
From MaRDI portal
The following pages link to \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898):
Displaying 8 items.
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
- Neighbor-sum-distinguishing edge choosability of subcubic graphs (Q1680485) (← links)
- Neighbor sum distinguishing list total coloring of subcubic graphs (Q1743484) (← links)
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
- Neighbor sum distinguishing total choosability of cubic graphs (Q2227993) (← links)
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
- Neighbor sum distinguishing total choosability of graphs with larger maximum average degree. (Q2828964) (← links)