Regular bipartite graphs are antimagic (Q3608318): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.20347 / rank | |||
| Property / cites work | |||
| Property / cites work: Dense 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 / DOI | |||
| Property / DOI: 10.1002/JGT.20347 / rank | |||
Normal rank | |||
Latest revision as of 12:58, 21 December 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
