Inclusion total chromatic number
From MaRDI portal
Publication:2037565
DOI10.1016/J.DISC.2021.112489zbMATH Open1471.05035OpenAlexW3170885467WikidataQ112880950 ScholiaQ112880950MaRDI QIDQ2037565FDOQ2037565
Authors: 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
Recommendations
adjacent vertex distinguishing total colouringinclusion total chromatic numberinclusion-free total colouring
Cites Work
- Title not available (Why is that?)
- Adjacent strong edge coloring of graphs
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Concise proofs for adjacent vertex-distinguishing total colorings
- 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
- Adjacent Vertex Distinguishing Edge‐Colorings
- The adjacent vertex distinguishing total chromatic number
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- A bound on the total chromatic number
- On the AVDTC of 4-regular graphs
- Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
Cited In (1)
This page was built for publication: Inclusion total chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037565)