Neighbor sum distinguishing total choosability of cubic graphs

DOI10.1007/S00373-020-02196-3zbMATH Open1458.05086OpenAlexW3033785580MaRDI QIDQ2227993FDOQ2227993

Authors: Donghan Zhang, You Lu, Shenggui Zhang 

Publication date: 16 February 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02196-3

Recommendations

• Neighbor sum distinguishing list total coloring of subcubic graphs
• List neighbor sum distinguishing edge coloring of subcubic graphs
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Neighbor sum distinguishing total colorings of planar graphs
• Neighbor-sum-distinguishing edge choosability of subcubic graphs

zbMATH Keywords

cubic graphscombinatorial Nullstellensatzneighbor sum distinguishing total choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• On the total-neighbor-distinguishing index by sums
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Combinatorial Nullstellensatz
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total coloring of graphs with bounded treewidth
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Neighbor sum distinguishing list total coloring of subcubic graphs

Cited In (5)

• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Title not available (Why is that?)
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles

This page was built for publication: Neighbor sum distinguishing total choosability of cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227993)