On adjacent-vertex-distinguishing total coloring of graphs
From MaRDI portal
Publication:2574667
zbMath1080.05036MaRDI QIDQ2574667
Bing Yao, Zhong Fu Zhang, Xiang'en Chen, Jian-fang Wang, Xin-zhong Lü, Jing-wen Li
Publication date: 30 November 2005
Published in: Science in China. Series A (Search for Journal in Brave)
Related Items (78)
A note on graph proper total colorings with many distinguishing constraints ⋮ 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 ⋮ Distant set distinguishing total colourings of graphs ⋮ 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 ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Neighbor sum distinguishing total coloring of 2-degenerate graphs ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ Upper bounds on adjacent vertex distinguishing total chromatic number of graphs ⋮ On gap-labellings of some families 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 ⋮ Improved bounds on linear coloring of plane graphs ⋮ 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 ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs ⋮ An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs ⋮ Distant total sum distinguishing index of graphs ⋮ Unnamed Item ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ The adjacent vertex distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ AVDTC numbers of generalized Halin graphs with maximum degree at least 6 ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ On the adjacent-vertex-strongly-distinguishing total coloring of graphs ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ 2-distance vertex-distinguishing total coloring of graphs ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ Vertex coloring of graphs by total 2-weightings ⋮ 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 ⋮ Adjacent vertex distinguishing total colorings of outerplanar graphs ⋮ On the AVDTC of 4-regular graphs ⋮ Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Inclusion total chromatic number ⋮ 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 ⋮ Locating-Domination and Identification ⋮ Concise proofs for adjacent vertex-distinguishing total colorings ⋮ Adjacent strong edge colorings and total colorings of regular graphs ⋮ Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs ⋮ General vertex-distinguishing total coloring of graphs ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ AVD-total-colouring of complete equipartite graphs ⋮ On the total-neighbor-distinguishing index by sums ⋮ \(d\)-strong total colorings of graphs ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing ⋮ Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs
This page was built for publication: On adjacent-vertex-distinguishing total coloring of graphs
