On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
From MaRDI portal
Publication:932658
DOI10.1016/j.disc.2007.07.091zbMath1203.05052OpenAlexW1998350558MaRDI QIDQ932658
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.091
Related Items (51)
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 ⋮ Strict neighbor-distinguishing total index of graphs ⋮ On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs ⋮ Adjacent vertex distinguishing total colorings of 2-degenerate graphs ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ Upper bounds on adjacent vertex distinguishing total chromatic number of graphs ⋮ 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 ⋮ On the AVDTC of Sierpiński-type graphs ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ The adjacent vertex distinguishing total chromatic number ⋮ Unnamed Item ⋮ The adjacent vertex distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ 2-distance vertex-distinguishing total coloring of graphs ⋮ 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 ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ A note on decycling number, vertex partition and AVD-total coloring in graphs ⋮ A note on the adjacent vertex distinguishing total chromatic number of graphs ⋮ On the AVDTC of 4-regular graphs ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ On the total and AVD-total coloring of graphs ⋮ Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ Neighbor product distinguishing total colorings of 2-degenerate graphs ⋮ 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 ⋮ General vertex-distinguishing total coloring of graphs ⋮ AVD-total-colouring of complete equipartite graphs ⋮ On the total-neighbor-distinguishing index by sums ⋮ \(d\)-strong total colorings of graphs ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs
Cites Work
- Unnamed Item
- \(r\)-strong edge colorings of graphs
- On the vertex-distinguishing proper edge-colorings of graphs
- Adjacent strong edge coloring of graphs
- Total colourings of graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- On adjacent-vertex-distinguishing total coloring of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
This page was built for publication: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
