Short Solution of Kotzig's Problem for Bipartite Graphs
In 1975, A. Kotzig posed the following problem: LetGbe at-regular graph which has a proper edget-coloring,t⩾4. Is it possible to obtain, from one proper edget-coloring ofG, any other proper edge t-coloring of G using only transformations of 2-colored and 3-colored subgraphs such that the intermediat...
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial theory. Series B 1998-11, Vol.74 (2), p.160-168 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In 1975, A. Kotzig posed the following problem: LetGbe at-regular graph which has a proper edget-coloring,t⩾4. Is it possible to obtain, from one proper edget-coloring ofG, any other proper edge t-coloring of G using only transformations of 2-colored and 3-colored subgraphs such that the intermediate colorings are also proper? The author and A. N. Mirumian proved that it is possible ifGis a bipartite graph. We give here a short proof of this result. |
|---|---|
| ISSN: | 0095-8956 1096-0902 1096-0902 |
| DOI: | 10.1006/jctb.1998.1838 |