Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz

DOI10.1007/S10255-016-0583-8MaRDI QIDQ287913zbMATH OpenOpenAlexFDO

Authors Cun-quan Qu, Lai-hao Ding, Guanghui Wang, Guiying Yan

Publication date 23 May 2016

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

Full work available at URL https://doi.org/10.1007/s10255-016-0583-8

zbMATH Keywords

combinatorial nullstellensatzneighbor sum distinguishing total coloringneighbor sum distinguishing total choice number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
• Neighbor sum distinguishing index of a kind of sparse graphs

Cites work

• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Antimagic labelling of vertex weighted graphs
• Combinatorial Nullstellensatz
• Edge weights and vertex colours
• Graph theory with applications
• Irregularity strength of regular graphs
• Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
• 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 colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On a \(1,2\) conjecture
• On adjacent-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the total-neighbor-distinguishing index by sums
• The adjacent vertex distinguishing total coloring of planar graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Weighted-1-antimagic graphs of prime power order

Cited in

(5)

• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Neighbor sum distinguishing total choosability of cubic graphs
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
• Neighbor sum distinguishing total coloring of a kind of sparse graph.
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz

This page was built for publication: Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz

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