Pages that link to "Item:Q2897212"

The following pages link to Antimagic labelling of vertex weighted graphs (Q2897212):

Displaying 26 items.

• 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)
• Weighted antimagic labeling: an algorithmic approach (Q324749) (← links)
• On antimagic labeling of regular graphs with particular factors (Q396690) (← links)
• Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
• Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
• On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
• On edge-graceful labeling and deficiency for regular graphs (Q1643920) (← links)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• Weighted antimagic labeling (Q1752499) (← links)
• Antimagic labelings of caterpillars (Q2008558) (← links)
• Shifted-antimagic labelings for graphs (Q2045398) (← links)
• Antimagic labeling of forests with sets of consecutive integers (Q2065767) (← links)
• Graphs admitting antimagic labeling for arbitrary sets of positive numbers (Q2184690) (← links)
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← 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)
• Graphs admitting antimagic labeling for arbitrary sets of positive integers (Q2413165) (← links)
• Local antimagic labeling of graphs (Q2423101) (← links)
• Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
• List-antimagic labeling of vertex-weighted graphs (Q5024668) (← links)
• Graph antimagic labeling: a survey (Q6542943) (← links)
• On \(k\)-shifted antimagic spider forests (Q6611091) (← links)