Regular Graphs of Odd Degree Are Antimagic (Q2947855): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1608199112 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1303.4850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular bipartite graphs 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: Antimagic Labeling of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Antimagic Labeling of Odd Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic Properties of Graphs with Large Maximum Degree / rank
 
Normal rank

Latest revision as of 19:37, 10 July 2024

scientific article
Language Label Description Also known as
English
Regular Graphs of Odd Degree Are Antimagic
scientific article

    Statements

    Identifiers