Pages that link to "Item:Q2374166"
From MaRDI portal
The following pages link to Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166):
Displayed 16 items.
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550) (← 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)
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)
- Neighbor sum distinguishing total colorings of corona of subcubic graphs (Q2045233) (← 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)
- Weight choosability of graphs with maximum degree 4 (Q2194741) (← links)
- Neighbor product distinguishing total colorings of 2-degenerate graphs (Q2292128) (← links)
- Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- 2-distance vertex-distinguishing total coloring of graphs (Q4634521) (← links)
- On the AVDTC of Sierpiński-type graphs (Q6153464) (← links)