Regular bipartite graphs are antimagic (Q3608318): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| 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 | |||
Latest revision as of 02:33, 29 June 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
