Pages that link to "Item:Q2514004"

The following pages link to Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs (Q2514004):

Displaying 50 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)
• Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← 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)
• Neighbor product distinguishing total colorings (Q512884) (← links)
• Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← 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)
• 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)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← 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 coloring of triangle free IC-planar graphs (Q1987570) (← links)
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← 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)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224) (← links)
• Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920) (← 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 colorings of planar graphs with maximum degree \(\varDelta\) (Q2352779) (← 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 distinguishing total coloring of planar graphs without 5-cycles (Q2402272) (← links)
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← 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)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418) (← links)
• A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← links)
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← links)
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)