Sciweavers

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

75

COMBINATORICS
2004

83views more COMBINATORICS 2004»

Coloring with no 2-Colored P4's

15 years 2 months ago

Coloring with no 2-Colored P4's

Download www.combinatorics.org

Michael O. Albertson, Glenn G. Chappell, Henry A.

Real-time Traffic

COMBINATORICS 2004 |

claim paper

Related Content

» An expected polynomial time algorithm for coloring 2colorable 3graphs

» Low Memory Distributed Protocols for 2Coloring

» How many random edges make a dense hypergraph non2colorable

» Monochromatic Hamiltonian 3tight Berge cycles in 2colored 4uniform hypergraphs

» Approximating Maximum Edge 2Coloring in Simple Graphs Via Local Improvement

» An Improved Approximation Algorithm for Maximum Edge 2Coloring in Simple Graphs

» Approximating Maximum Edge 2Coloring in Simple Graphs

» Colored Simultaneous Geometric Embeddings

» Note on Gy Elekess Conjectures Concerning Unavoidable Patterns in Proper Colorings

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMBINATORICS
Authors	Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi

Comments (0)