Regular bipartite graphs are antimagic (Q3608318): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.20347 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4235475206 / rank | |||
Normal rank |
Revision as of 18:54, 19 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
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