On the D(2)-vertex distinguishing total coloring of graphs with =3
From MaRDI portal
Publication:2170502
The authors consider total colorings of graphs, that is the mappings assigning a color to every edge and every vertex of a graph. Such coloring is \(D(2)\)-vertex distinguishing if it is proper and for every pair of vertices at distance \(2\) their sets of colors are distinct. It is proved in the paper that in the case of graphs satisfying \(\Delta(G)\leq 3\) it is enough to use \(11\) colors to obtain a \(D(2)\)-vertex distinguishing coloring.
Recommendations
- 2-distance vertex-distinguishing total coloring of graphs
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- An upper bound for D(2)-vertex-distinguishing proper edge chromatic numbers of graphs
- D()-vertex-distinguishing proper total coloring of the generalized Mycielski graph M_n(P^3_m)
Cites work
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
- Graph theory with applications
- Leaky modes and wave components of a fluid-filled borehole embedded in an elastic medium
- List-coloring the square of a subcubic graph
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
- Neighbor sum distinguishing total colorings of corona of subcubic graphs
- 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\)
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
Cited in
(10)- On \(d_2\)-coloring of certain families of graphs
- Distant set distinguishing total colourings of graphs
- Distinguishing graphs by total colourings
- D()-vertex-distinguishing proper total coloring of the generalized Mycielski graph M_n(P^3_m)
- d-strong total colorings of cycles when 35 d 55
- D(r)-vertex distinguishing edge coloring of trees
- On \(N_2\)-vertex coloring of graphs
- 2-distance vertex-distinguishing total coloring of graphs
- scientific article; zbMATH DE number 6403946 (Why is no real title available?)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
This page was built for publication: On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170502)
