Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
From MaRDI portal
Publication:5017728
DOI10.1360/012011-359zbMath1488.05182OpenAlexW2314333754MaRDI QIDQ5017728
Publication date: 17 December 2021
Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1360/012011-359
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (29)
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree ⋮ Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ The adjacent vertex distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ Neighbor product distinguishing total colorings ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ A note on the adjacent vertex distinguishing total chromatic number of graphs ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs
This page was built for publication: Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
