Antimagic labelling of vertex weighted graphs (Q2897212): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice grids and prisms are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti‐magic graphs via the Combinatorial NullStellenSatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of the combinatorial Nullstellensatz to a graph labelling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-sum partitions and anti-magic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edge 3-colorings of a planar cubic graph as a permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On anti-magic labeling for graph products / rank
 
Normal rank

Latest revision as of 11:21, 5 July 2024

scientific article
Language Label Description Also known as
English
Antimagic labelling of vertex weighted graphs
scientific article

    Statements