The adjacent vertex distinguishing total chromatic number

DOI10.1016/J.DISC.2012.04.006zbMath1245.05042arXiv1009.1785OpenAlexW1973563055MaRDI QIDQ442409

Karen Johannson, Tom Coker

Publication date: 10 August 2012

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

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

zbMATH Keywords

chromatic numberadjacent vertex distinguishingproper total colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (22)

Strict neighbor-distinguishing total index of graphs ⋮ On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs ⋮ Distant set distinguishing total colourings of graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ 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 ⋮ Unnamed Item ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ 2-distance vertex-distinguishing total coloring of graphs ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ A note on the adjacent vertex distinguishing total chromatic number of graphs ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Inclusion total chromatic number ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ \(d\)-strong total colorings of graphs

Cites Work

• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Concise proofs for adjacent vertex-distinguishing total colorings
• A bound on the total chromatic number
• Adjacent strong edge coloring of graphs
• Concentration of measure and isoperimetric inequalities in product spaces
• 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
• Concentration for self-bounding functions and an inequality of Talagrand
• Vertex-distinguishing proper edge-colorings
• Paths in graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• New concentration inequalities in product spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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