Edge-colouring seven-regular planar graphs
From MaRDI portal
Abstract: A conjecture due to the fourth author states that every -regular planar multigraph can be -edge-coloured, provided that for every odd set of vertices, there are at least edges between and its complement. For this is the four-colour theorem, and the conjecture has been proved for all , by various authors. In particular, two of us proved it when ; and then three of us proved it when . The methods used for the latter give a proof in the case that is simpler than the original, and we present it here.
Recommendations
Cites work
Cited in
(7)- Graph edge coloring: a survey
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees
- A survey on flows in graphs and matroids
- Edge-colouring eight-regular planar graphs
- Signed projective cubes, a homomorphism point of view
- Packing six \(T\)-joins in plane graphs
This page was built for publication: Edge-colouring seven-regular planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491000)