On the adjacent vertex-distinguishing total chromatic numbers of the graphs with (G) = 3
From MaRDI portal
Publication:2460105
Recommendations
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Concise proofs for adjacent vertex-distinguishing total colorings
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Adjacent vertex distinguishing total colorings of graphs with smaller degrees
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
Cites work
- scientific article; zbMATH DE number 5006756 (Why is no real title available?)
- scientific article; zbMATH DE number 1506763 (Why is no real title available?)
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing edge colorings of graphs
- Vertex-distinguishing proper edge-colorings
Cited in
(57)- On the AVDTC of Sierpiński-type graphs
- scientific article; zbMATH DE number 7447359 (Why is no real title available?)
- scientific article; zbMATH DE number 721725 (Why is no real title available?)
- On proper total colorings of graphs with three constraints
- scientific article; zbMATH DE number 6129961 (Why is no real title available?)
- Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Asymptotic behavior of the adjacent vertex distinguishing total coloring of graphs
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
- On the total and AVD-total coloring of graphs
- Adjacent vertex-distinguishing total colorings of graphs with constraint conditions
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
- Vertex coloring of graphs by total 2-weightings
- Neighbor sum distinguishing total colorings of corona of subcubic graphs
- Adjacent vertex distinguishing total coloring in split graphs
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Inclusion total chromatic number
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Concise proofs for adjacent vertex-distinguishing total colorings
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- Adjacent vertex distinguishing total colorings of graphs with smaller degrees
- Adjacent-vertex-distinguishing total coloring of indifference graphs
- The bounds of the Smarandachely adjacent vertex total colorings of some kinds of 3-regular graphs
- Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
- AVD-total-colouring of complete equipartite graphs
- The smarandachely adjacent vertex total coloring of a kind of 3-regular graphs.
- Distant set distinguishing total colourings of graphs
- The adjacent vertex distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- General vertex-distinguishing total coloring of graphs
- The adjacent vertex distinguishing total chromatic number
- On the AVDTC of 4-regular graphs
- On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Strict neighbor-distinguishing total index of graphs
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
- A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
- 2-distance vertex-distinguishing total coloring of graphs
- Neighbor product distinguishing total colorings of 2-degenerate graphs
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
- Adjacent-vertex-distinguishing total chromatic numbers on Mycielski's graphs on several kinds of particular graphs
- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
- A note on decycling number, vertex partition and AVD-total coloring in graphs
- Upper bounds for adjacent vertex-distinguishing edge coloring
- Neighbor sum distinguishing total colorings of planar graphs
- A note on the adjacent vertex distinguishing total chromatic number of some cubic graphs.
- Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
This page was built for publication: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460105)
