Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10

DOI10.1007/S10255-024-1110-YzbMATH Open1530.05060MaRDI QIDQ6178525FDOQ6178525

Authors: Donghan Zhang, You Lu, Shenggui Zhang, Li Zhang 

Publication date: 16 January 2024

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Recommendations

• Neighbor sum distinguishing total colorings of planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)

zbMATH Keywords

planar graphscombinatorial nullstellensatzdischarging methodneighbor sum distinguishing total choosibility

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On the neighbor sum distinguishing total coloring of planar graphs
• 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
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• 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 coloring of IC-planar graphs
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Neighbor sum distinguishing list total coloring of subcubic graphs
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Neighbor sum distinguishing total choosability of cubic graphs

This page was built for publication: Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10

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