Pages that link to "Item:Q2444142"

The following pages link to The adjacent vertex distinguishing total coloring of planar graphs (Q2444142):

Displaying 49 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)
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← 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)
• Adjacent vertex distinguishing total colorings of outerplanar graphs (Q965812) (← 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)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← links)
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← 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 edge coloring of IC-planar graphs (Q2136165) (← links)
• Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← 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)
• Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
• General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
• AVD-total-colouring of complete equipartite graphs (Q2341767) (← links)
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) (Q2352779) (← links)
• Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
• Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← 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)
• Distant set distinguishing total colourings of graphs (Q2629496) (← links)
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
• On the adjacent vertex distinguishing total chromatic number of outer plane graph. (Q2864477) (← links)
• Adjacent-vertex-distinguishing total coloring of planar bipartite graphs (Q2886280) (← links)
• (Q3384719) (← links)
• (Q3404777) (← links)
• (Q4604121) (← links)
• (Q4623819) (← links)
• On the total and AVD-total coloring of graphs (Q4956171) (← links)
• (Q5037994) (← links)
• Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree (Q6121343) (← links)