The following pages link to On the AVDTC of 4-regular graphs (Q2017055):
Displaying 15 items.
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) (Q516897) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← links)
- Inclusion total chromatic number (Q2037565) (← links)
- Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
- Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
- General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- (Q3384719) (← links)
- On the total and AVD-total coloring of graphs (Q4956171) (← links)
- On the AVDTC of Sierpiński-type graphs (Q6153464) (← links)
