Neighbor sum distinguishing total colorings of triangle free planar graphs

DOI10.1007/S10114-015-4114-YzbMATH Open1317.05065OpenAlexW1983048542MaRDI QIDQ2355461FDOQ2355461

Authors: Jihui Wang, Qiaoling Ma, Xue Han 

Publication date: 23 July 2015

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

Full work available at URL: https://doi.org/10.1007/s10114-015-4114-y

Recommendations

• Neighbor sum distinguishing total colorings of planar graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles

zbMATH Keywords

neighbor sum distinguishing total coloringcombinatorial Nullstellensatztriangle free planar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Edge weights and vertex colours
• On adjacent-vertex-distinguishing total coloring of graphs
• Graph theory with applications
• On a \(1,2\) conjecture
• Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
• 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 (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
• Antimagic labelling of vertex weighted graphs
• Bounding the monomial index and \((1,l)\)-weight choosability of a graph
• Combinatorial Nullstellensatz
• 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
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Total weight choosability of graphs
• Total weight choosability of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)

Cited In (22)

• Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Title not available (Why is that?)
• Neighbor sum distinguishing total colorings of planar graphs
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
• On the neighbor sum distinguishing total coloring of planar graphs
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs

This page was built for publication: Neighbor sum distinguishing total colorings of triangle free planar graphs

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