Page d'accueil du CNRS Page d'accueil de Paris Diderot Page d'accueil du LIAFA
LIAFA		 Laboratoire d'Informatique Algorithmique: Fondements et Applications
CNRS UMR 7089, Université Paris Diderot - Paris 7, Case 7014
75205 Paris Cedex 13 - Tél: +33(0)1.57.27.92.56 - Fax: +33(0)1.57.27.94.09
 Page d'accueil de la fondation Sciences Mathématiques de Paris Page d'accueil de FRMPC
   Staff      Contact      How to get to LIAFA      Teaching      Webmail   


Version française
Research reports

  • Report number: 1995-087
  • Authors: L. PERKOVIC, B. REED
  • Title: Edge coloring regular graphs of high degree
  • Summary:


     We discuss thefollowing conjecture : If G = (V,E) is a D-regular simple graph with an even number of vertices at most 2D then G is D edge colorable. In this paper we show that the conjecture is true for large graphs if ()V<(2-)D . We discuss related results.



  • Complete report:
    PostScript file compressed with gzip
    PostScript format
    pdf format
 
 ©  LIAFA 1995, Last updating: 2013, May webmestre[at]liafa.univ-paris-diderot.fr