Pages that link to "Item:Q965812"

The following pages link to Adjacent vertex distinguishing total colorings of outerplanar graphs (Q965812):

Displaying 33 items.

• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
• Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
• Neighbor product distinguishing total colorings (Q512884) (← links)
• 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)
• 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)
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← 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)
• Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
• General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
• AVD-total-colouring of complete equipartite graphs (Q2341767) (← links)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← 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)
• The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← links)
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418) (← links)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs (Q2514004) (← links)
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
• (Q3384719) (← links)
• On the total and AVD-total coloring of graphs (Q4956171) (← links)
• Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065) (← links)