On the neighbor sum distinguishing total coloring of planar graphs

DOI10.1016/J.TCS.2015.09.017zbMATH Open1331.05084OpenAlexW1773291652MaRDI QIDQ897872FDOQ897872

Authors: Xiaowei Yu, Cun-quan Qu, Guanghui Wang, Jian-Liang Wu 

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.017

Recommendations

• Neighbor sum distinguishing total colorings of planar graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sums distinguishing total colorings of planar graphs without short cycles
• Neighbor sum distinguishing total chromatic number of planar graphs
• Neighbor sum distinguishing total colorings of planar graphs with girth at least 5
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• Neighbor sum distinguishing total coloring of IC-planar graphs
• On the neighbor sum-distinguishing vertex coloring of a graph

zbMATH Keywords

planar graphtotal coloringcombinatorial nullstellensatzneighbor sum distinguishing total coloringdischarging

Mathematics Subject Classification ID

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

Cites Work

• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Edge weights and vertex colours
• On adjacent-vertex-distinguishing total coloring of graphs
• On a \(1,2\) conjecture
• Title not available (Why is that?)
• 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
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• 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
• Combinatorial Nullstellensatz
• Weighted-1-antimagic graphs of prime power order
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• 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\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• The number of edge 3-colorings of a planar cubic graph as a permanent
• The adjacent vertex distinguishing total chromatic number

Cited In (39)

• Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• Title not available (Why is that?)
• Title not available (Why is that?)
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Neighbor sum distinguishing index of sparse graphs
• Title not available (Why is that?)
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• 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 coloring of planar graphs with restrained cycles
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• 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
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Total coloring of planar graphs without adjacent chordal 6-cycles
• Neighbor product distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total coloring of IC-planar graphs
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
• Neighbor sum distinguishing total chromatic number of planar graphs

This page was built for publication: On the neighbor sum distinguishing total coloring of planar graphs

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