Pages that link to "Item:Q442409"

The following pages link to The adjacent vertex distinguishing total chromatic number (Q442409):

Displaying 21 items.

• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
• On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
• A note on the adjacent vertex distinguishing total chromatic number of graphs (Q1759396) (← 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)
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
• \(d\)-strong total colorings of graphs (Q2346331) (← links)
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
• Distant set distinguishing total colourings of graphs (Q2629496) (← links)
• (Q3384719) (← links)
• On the AVDTC of Sierpiński-type graphs (Q6153464) (← links)