An exact value for the path-chromatic index of a complete graph
We prove that the edge of <em>K</em><sub><em>n</em></sub> cannot be partitioned into less than <em>(n-1)/t P</em><sub><em>i+2</em></sub>-free subgraphs. We show that this inequality is sharp and characterize the edge partition...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
1989-10-01
|
| Series: | Le Matematiche |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/691 |