Regular bipartite graphs are antimagic (Q3608318): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:10, 5 February 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
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
