Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms

  • Authors:
  • Primož Potočnik

  • Affiliations:
  • Institute of Mathematics, Physics and Mechanics, (IMFM), Oddelek za matematiko, Univerza v Ljubljana, Jadranska 19, SI-1000 Ljubljana, Slovenia

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is proved that every connected cubic simple graph admitting a vertex-transitive action of a solvable group is either 3-edge-colourable, or isomorphic to the Petersen graph.