Sciweavers

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

3

DM
2000

favoriteEmaildiscussreport

80views more DM 2000»

An attempt to classify bipartite graphs by chromatic polynomials

13 years 4 months ago

An attempt to classify bipartite graphs by chromatic polynomials

Download math.nie.edu.sg

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles

Real-time Traffic

DM 2000 |

claim paper

Related Content

» Sum Coloring of Bipartite Graphs with Bounded Degree

» Mixing 3Colourings in Bipartite Graphs

» Colouring Planar Mixed Hypergraphs

» On the Difficulty of Designing Good Classifiers

» Locally checkable proofs

» Counting Subgraphs via Homomorphisms

» Constraint satisfaction a personal perspective

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DM
Authors	Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy

Comments (0)