Neighbor sum distinguishing total chromatic number of planar graphs

DOI10.1016/J.AMC.2018.03.013MaRDI QIDQ2333237zbMATH OpenOpenAlexFDO

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

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)

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\)

Cites work

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

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
• Note on the group edge irregularity strength of graphs
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• 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 = 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)