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

DOI10.1007/S10878-015-9886-6MaRDI QIDQ306111zbMATH OpenOpenAlexFDO

Authors Xue Han, Xiuyun Wang, Jihui Wang, Qiaoling 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

combinatorial Nullstellensatzintersecting trianglesneighbor sum distinguishing total coloring

Mathematics Subject Classification ID

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

Recommendations

• Total colorings of planar graphs without adjacent triangles
• The adjacent vertex distinguishing total coloring of planar graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• scientific article; zbMATH DE number 6843221
• On the neighbor sum distinguishing total coloring of planar graphs
• A proper total coloring distinguishing adjacent vertices by sums of some product graphs
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs

Cites work

• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Antimagic labelling of vertex weighted graphs
• Combinatorial Nullstellensatz
• Graph theory with applications
• Irregularity strength of regular graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing index of planar graphs
• 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 of planar graphs
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• 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

(7)

• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• 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 choosability of planar graphs with maximum degree at least 10
• Neighbor sum distinguishing total coloring of planar graphs with restrained cycles
• Total-neighbor-distinguishing coloring by sums of fractals of generalized Sierpiński graphs
• Total colorings of planar graphs without adjacent triangles

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

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