Inclusion total chromatic number

DOI10.1016/J.DISC.2021.112489zbMath1471.05035OpenAlexW3170885467WikidataQ112880950 ScholiaQ112880950MaRDI QIDQ2037565

Jakub Kwaśny

Publication date: 8 July 2021

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

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112489

zbMATH Keywords

adjacent vertex distinguishing total colouringinclusion total chromatic numberinclusion-free total colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• The adjacent vertex distinguishing total chromatic number
• Concise proofs for adjacent vertex-distinguishing total colorings
• A bound on the total chromatic number
• Adjacent strong edge coloring of graphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• On the AVDTC of 4-regular graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• 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
• Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Inclusion total chromatic number