Pages that link to "Item:Q2345540"

The following pages link to On the total-neighbor-distinguishing index by sums (Q2345540):

Displaying 42 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)
• 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 via the combinatorial nullstellensatz (Q477256) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
• Neighbor product distinguishing total colorings (Q512884) (← links)
• Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring (Q1701100) (← links)
• Distant total sum distinguishing index of graphs (Q1712511) (← 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)
• Neighbor sum distinguishing list total coloring of subcubic graphs (Q1743484) (← links)
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← links)
• Neighbor sum distinguishing total colorings of corona of subcubic graphs (Q2045233) (← links)
• Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224) (← links)
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
• Neighbor sum distinguishing total choosability of cubic graphs (Q2227993) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
• Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
• On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
• Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs (Q2374159) (← 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)
• 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)
• Distant set distinguishing total colourings of graphs (Q2629496) (← links)
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← links)
• Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles (Q5071596) (← links)
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
• Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree (Q6121343) (← links)
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)