Neighbor sum distinguishing total colorings of corona of subcubic graphs

DOI10.1007/S40840-020-01033-3MaRDI QIDQ2045233zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 6813611 (Why is no real title available?)
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Graph theory with applications
• Landmarks in graphs
• Leaky modes and wave components of a fluid-filled borehole embedded in an elastic medium
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing list total coloring of subcubic graphs
• Neighbor sum distinguishing total chromatic number of planar graphs
• 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 5-cycles
• Neighbor sum distinguishing total coloring of sparse IC-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 via the combinatorial nullstellensatz
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On the corona of two graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• On the total-neighbor-distinguishing index by sums
• Packing coloring of some undirected and oriented coronae graphs
• Structure-activity maps for visualizing the graph variables arising in drug design
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• The adjacent vertex distinguishing total coloring of planar graphs
• The adjacent vertex-distinguishing total chromatic number of 1-tree

Cited in

(3)

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

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)