A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles

DOI10.1007/S10878-015-9886-6zbMath1343.05066OpenAlexW1969022519MaRDI QIDQ306111

Xiuyun Wang, Xue Han, Ji Hui Wang, Qiao Ling Ma

Publication date: 31 August 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9886-6

zbMATH Keywords

neighbor sum distinguishing total coloringcombinatorial Nullstellensatzintersecting triangles

Mathematics Subject Classification ID

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

Related Items (4)

Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph ⋮ Neighbor sum distinguishing total coloring of planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles

Cites Work

• Unnamed Item
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Weighted-1-antimagic graphs of prime power order
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Irregularity strength of regular graphs
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Antimagic labelling of vertex weighted graphs
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles