Neighbor sum distinguishing total chromatic number of planar graphs

DOI10.1016/J.AMC.2018.03.013zbMATH Open1427.05093OpenAlexW2796132400MaRDI QIDQ2333237FDOQ2333237

Authors: Changqing Xu, Jianguo Li, Shan Ge 

Publication date: 12 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.03.013

Recommendations

• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of planar graphs with girth at least 5
• On the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)

zbMATH Keywords

planar graphcombinatorial Nullstellensatzneighbor sum distinguishing total chromatic number

Mathematics Subject Classification ID

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

Cites Work

• On adjacent-vertex-distinguishing total coloring of graphs
• Graph theory with applications
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Combinatorial Nullstellensatz
• 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
• On the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• Neighbor sums distinguishing total colorings of planar graphs without short cycles
• Neighbor sum distinguishing total colorings of planar graphs with girth at least 5
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles

Cited In (18)

• Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Neighbor sum distinguishing total choosability of cubic graphs
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• Note on the group edge irregularity strength of graphs
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
• Neighbor sum distinguishing total choosability of planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• 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\)
• 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 colorings of planar graphs with girth at least 5
• Neighbor sum distinguishing total coloring of IC-planar graphs
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)

This page was built for publication: Neighbor sum distinguishing total chromatic number of planar graphs

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