Chromatic index critical graphs of order 9

We prove that a 2-connected graph of order 9 having maximum valency @D >= 4 is chromatic index critical if and only if its valency-list is one of the following: 24^8, 3^24^7 (except one graph), 25^8, 345^7, 4^35^6, 26^8, 356^7, 4^26^7, 45^26^6, 5^46^5, 27^8, 367^7, 457^7, 46^27^6, 5^267^6, 56^37^5, 6^57^4, 57^38^5, 6^38^6, 6^27^28^5, 67^48^4 and 7^68^3. This, together with known results, provide a complete catalogue of all chromatic index critical graphs of order =<10.

[1]  Mike Plantholt.  The chromatic index of graphs with a spanning star , 1981, J. Graph Theory.

[2]  Hian Poh Yap.  A construction of chromatic index critical graphs , 1981, J. Graph Theory.

[3]  Lowell W. Beineke,et al.  On small graphs critical with respect to edge colourings , 1976, Discret. Math..

[4]  Robin J. Wilson,et al.  Edge-colourings of graphs , 1977 .

[5]  Hian Poh Yap,et al.  On graphs critical with respect to edge-colourings , 1981, Discret. Math..

[6]  Hian Poh Yap.  On the critical graph conjecture , 1980, J. Graph Theory.

[7]  S. Fiorini,et al.  Some remarks on a paper by Vizing on critical graphs , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.

[8]  Ivan Tafteberg Jakobsen.  On critical graphs with chromatic index 4 , 1974, Discret. Math..