The adjacent vertex distinguishing total chromatic number

DOI10.1016/J.DISC.2012.04.006zbMATH Open1245.05042arXiv1009.1785OpenAlexW1973563055MaRDI QIDQ442409FDOQ442409

Authors: Tom Coker, Karen Johannson 

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges receive different colours and every vertex and incident edge receive different colours. This paper considers a strengthening of this condition and examines the minimum number of colours required for a total colouring with the additional property that for any adjacent vertices $u$ and $v$, the sets of colours incident to $u$ is different from the set of colours incident to $v$. It is shown that there is a constant $C$ so that for any graph $G$, there exists such a colouring using at most $Delta(G)+C$ colours.

Full work available at URL: https://arxiv.org/abs/1009.1785

Recommendations

• scientific article
• Adjacent vertex distinguishing total coloring of a class of graphs
• Adjacent vertex distinguishing total chromatic number of \(K_{2,n} \vee P_m\)
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• On the adjacent vertex distinguishing total chromatic number \(C_m\times K_n\)
• Adjacent-vertex-distinguishing total chromatic number of \(P_m\times K_n\)
• Adjacent-vertex distinguishing total chromatic numbers of compound intersecting cycles
• scientific article; zbMATH DE number 5631553
• On the adjacent vertex distinguishing total chromatic number of outer plane graph.
• Adjacent-vertex distinguishing total chromatic number on \(W_s\vee K_{m,n}\)

zbMATH Keywords

chromatic numberadjacent vertex distinguishingproper total colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• New concentration inequalities in product spaces
• Adjacent strong edge coloring of graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Paths in graphs
• Concentration of measure and isoperimetric inequalities in product spaces
• Concentration for self-bounding functions and an inequality of Talagrand
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Concise proofs for adjacent vertex-distinguishing total colorings
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A bound on the total chromatic number
• Title not available (Why is that?)

Cited In (27)

• Title not available (Why is that?)
• On the total set chromatic number of graphs
• 2-distance vertex-distinguishing total coloring of graphs
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• 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 AVDTC of Sierpiński-type graphs
• The adjacent vertex-distinguishing total chromatic number of folded hypercubes
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Neighbor sum distinguishing total choosability of planar graphs
• Strict neighbor-distinguishing total index of graphs
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• The adjacent vertex-distinguishing total chromatic number of 1-tree
• Inclusion total chromatic number
• \(d\)-strong total colorings of graphs
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
• A proper total coloring distinguishing adjacent vertices by sums of some product graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
• Not necessarily proper total colourings which are adjacent vertex distinguishing
• Distant set distinguishing total colourings of graphs

This page was built for publication: The adjacent vertex distinguishing total chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442409)