Recommendations
Cites work
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- A bound on the total chromatic number
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- Adjacent strong edge coloring of graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
- Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
- Concise proofs for adjacent vertex-distinguishing total colorings
- On adjacent-vertex-distinguishing total coloring of graphs
- On the AVDTC of 4-regular graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- The adjacent vertex distinguishing total chromatic number
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
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)