权威例句
On adjacent-vertex-distinguishing total coloring of graphsIncidence Adjacent Vertex-Distinguishing Total Coloring of GraphsOn the adjacent-vertex-strongly-distinguishing total coloring of graphsAdjacent Vertex Distinguishing Edge-ColoringsΔ+300 is a bound on the adjacent vertex distinguishing edge chromatic numberOn the adjacent vertex distinguishing total coloring numbers of graphs with [formula omitted]Note: On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3 Δ = 3 mathContainer Loading Mathjax ☆On the adjacent vertex distinguishing total coloring numbers of graphs with Δ = 3Concise proofs for adjacent vertex-distinguishing total colorings