Regular bipartite graphs are antimagic (Q3608318): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 12:00, 5 March 2024

scientific article
Language Label Description Also known as
English
Regular bipartite graphs are antimagic
scientific article

    Statements

    Regular bipartite graphs are antimagic (English)
    0 references
    0 references
    4 March 2009
    0 references
    antimagic graph labeling
    0 references
    bipartite graph
    0 references
    regular graph
    0 references
    graph decomposition
    0 references
    marriage theorem
    0 references

    Identifiers