Regular bipartite graphs are antimagic (Q3608318)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Regular bipartite graphs are antimagic |
scientific article; zbMATH DE number 5523072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular bipartite graphs are antimagic |
scientific article; zbMATH DE number 5523072 |
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
0.9420342445373536
0 references
0.9224427938461304
0 references
0.91470468044281
0 references
0.9120463728904724
0 references
