Regular bipartite graphs are antimagic (Q3608318)

From MaRDI portal
Revision as of 02:33, 29 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Regular bipartite graphs are antimagic
scientific article

    Statements

    title
    Regular bipartite graphs are antimagic (English)
    0 references
    author
    Daniel W. Cranston
    0 references
    publication date
    4 March 2009
    0 references
    zbMATH Keywords
    antimagic graph labeling
    0 references
    bipartite graph
    0 references
    regular graph
    0 references
    graph decomposition
    0 references
    marriage theorem
    0 references

    Identifiers

    DOI
    10.1002/jgt.20347
    0 references
    zbMATH DE Number
    5523072
    0 references
    OpenAlex ID
    W4235475206
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3608318&oldid=35096405"
    Powered by MediaWiki