Neighbor sum distinguishing total choice number of planar graphs without 6-cycles

DOI10.1007/S10114-020-0144-1zbMATH Open1459.05094OpenAlexW3114848264MaRDI QIDQ1995610FDOQ1995610

Donghan Zhang, Shenggui Zhang, You Lu

Publication date: 24 February 2021

Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-020-0144-1

zbMATH Keywords

planar graphsneighbor sum distinguishing total choice numbercombinatorial Nullstellensatz

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the total-neighbor-distinguishing index by sums
• 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 distinguishing total colorings 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
• Neighbor sum distinguishing total chromatic number of planar graphs
• 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 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
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles

Cited In (5)

• 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
• Title not available (Why is that?)
• Neighbor sum distinguishing total coloring of planar graphs with restrained cycles
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles

This page was built for publication: Neighbor sum distinguishing total choice number of planar graphs without 6-cycles

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