Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CORR
2011
Springer

favoriteEmaildiscussreport

149views Education» more CORR 2011»

A new bound for parsimonious edge-colouring of graphs with maximum degree three

13 years 24 days ago

A new bound for parsimonious edge-colouring of graphs with maximum degree three

Download www.univ-orleans.fr

Jean-Luc Fouquet, Jean-Marie Vanherpe

Real-time Traffic

CORR 2011 | Education |

claim paper

Related Content

» The independence number in graphs of maximum degree three

» An Algorithm for ThreeDimensional Orthogonal Graph Drawing

» Path Layout on Tree Networks Bounds in Different Label Switching Models

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Jean-Luc Fouquet, Jean-Marie Vanherpe

Comments (0)