Homomorphisms and edge-colourings of planar graphs (Q875942): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.07.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024728183 / rank | |||
Normal rank | |||
Revision as of 22:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Homomorphisms and edge-colourings of planar graphs |
scientific article |
Statements
Homomorphisms and edge-colourings of planar graphs (English)
0 references
16 April 2007
0 references
The author conjectures that every planar graph of odd girth \(2k+1\) admits a homomorphism to the Cayley graph \(C(\mathbb{Z}_{2}^{2k+1},S_{2k+1})\), with \(S_{2k+1}\) being the set of \((2k+1)\)-vectors with exactly two consecutive 1's in a cyclic order. The main result is that this conjecture is equivalent to the corresponding case of a conjecture of P. Seymour, stating that every planar \((2k+1)\)-graph is \((2k+1) \)-edge-colorable.
0 references
planarity
0 references
Clebsch graph
0 references
