Neighbor sum distinguishing total colorings of corona of subcubic graphs

DOI10.1007/S40840-020-01033-3zbMATH Open1470.05053OpenAlexW3097966312MaRDI QIDQ2045233FDOQ2045233

Authors: Aijun Dong, Wenwen Zhang, Xiang Tan 

Publication date: 12 August 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-020-01033-3

Recommendations

• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• On the neighbor sum distinguishing total coloring of planar graphs
• A proper total coloring distinguishing adjacent vertices by sums of some product graphs
• Neighbor product distinguishing total colorings
• Neighbor sum distinguishing total colorings of planar graphs

zbMATH Keywords

total coloringsubcubic graphsneighbor sum distinguishing coloring

Mathematics Subject Classification ID

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

Cites Work

• On the corona of two graphs
• Graph theory with applications
• 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
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Landmarks in graphs
• Structure-activity maps for visualizing the graph variables arising in drug design
• 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
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Neighbor sum distinguishing total chromatic number of planar graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Leaky modes and wave components of a fluid-filled borehole embedded in an elastic medium
• 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\)
• Packing coloring of some undirected and oriented coronae graphs
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Neighbor sum distinguishing list total coloring of subcubic graphs
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• The adjacent vertex-distinguishing total chromatic number of 1-tree
• Title not available (Why is that?)

Cited In (3)

• A proper total coloring distinguishing adjacent vertices by sums of some product graphs
• On the mutual visibility in Cartesian products and triangle-free graphs
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)

This page was built for publication: Neighbor sum distinguishing total colorings of corona of subcubic graphs

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