\mbox{\boldmath \Delta=3} 的图的邻和可区别全可选性
From MaRDI portal
Publication:3179898
Recommendations
- Neighbor sum distinguishing total choosability of cubic graphs
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
- Neighbor sum distinguishing total choosability of planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
Cited in
(9)- Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
- Neighbor sum distinguishing total choosability of cubic graphs
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth
- Neighbor sum distinguishing list total coloring of subcubic graphs
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
- Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
This page was built for publication: \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179898)
