(2, 3)-bipartite graphs are strongly 6-edge-choosable (Q6304990)
From MaRDI portal
scientific article; zbMATH DE number 900355929
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | (2, 3)-bipartite graphs are strongly 6-edge-choosable |
scientific article; zbMATH DE number 900355929 |
Statements
3 August 2018
0 references
math.CO
0 references
