Overfull conjecture for graphs with high minimum degree (Q3159391): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123290720, #quickstatements; #temporary_batch_1711504555137 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank | |||
Normal rank | |||
Latest revision as of 18:09, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Overfull conjecture for graphs with high minimum degree |
scientific article |
Statements
Overfull conjecture for graphs with high minimum degree (English)
0 references
16 February 2005
0 references
chromatic index
0 references
1-factor
0 references
overful conjecture
0 references
