\mbox{\boldmath \Delta=3} 的图的邻和可区别全可选性

DOI10.11845/SXJZ.2014195BzbMATH Open1363.05087OpenAlexW1549456623MaRDI QIDQ3179898FDOQ3179898

Zeling Shao, Changqing Xu, Jing Jing Yao

Publication date: 6 January 2017

Full work available at URL: http://oaj.pku.edu.cn/sxjz/CN/abstract/abstract71329.shtml

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

zbMATH Keywords

combinatorial Nullstellensatzmaximum average degreeneighbor sum distinguishing total choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles

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)