<--- Back to Details
First PageDocument Content
Graph theory / Graph coloring / Rainbow coloring / Edge coloring
Date: 2014-08-22 14:45:16
Graph theory
Graph coloring
Rainbow coloring
Edge coloring

Rainbow copies of C4 in edge-colored hypercubes J. Balogh ∗ M. Delcourt

Add to Reading List

Source URL: orion.math.iastate.edu

Download Document from Source Website

File Size: 198,16 KB

Share Document on Facebook

Similar Documents

Rainbow copies of C4 in edge-colored hypercubes J. Balogh ∗  M. Delcourt

Rainbow copies of C4 in edge-colored hypercubes J. Balogh ∗ M. Delcourt

DocID: 1qg2o - View Document

Rainbow triangles in three-colored graphs J´ozsef Balogh∗ Ping Hu†  Bernard Lidick´

Rainbow triangles in three-colored graphs J´ozsef Balogh∗ Ping Hu† Bernard Lidick´

DocID: 1peVS - View Document

AVOIDING RAINBOW INDUCED SUBGRAPHS IN VERTEX-COLORINGS MARIA AXENOVICH AND RYAN MARTIN Abstract. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G −→ H if in any vertex-coloring of

AVOIDING RAINBOW INDUCED SUBGRAPHS IN VERTEX-COLORINGS MARIA AXENOVICH AND RYAN MARTIN Abstract. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G −→ H if in any vertex-coloring of

DocID: 1kpt0 - View Document

AVOIDING RAINBOW INDUCED SUBGRAPHS IN EDGE-COLORINGS CHELSEA SACKETT AND MARIA AXENOVICH Abstract. Let H be a fixed graph on k vertices. For an edge-coloring c of H, we say that H is rainbow, or totally multicolored if

AVOIDING RAINBOW INDUCED SUBGRAPHS IN EDGE-COLORINGS CHELSEA SACKETT AND MARIA AXENOVICH Abstract. Let H be a fixed graph on k vertices. For an edge-coloring c of H, we say that H is rainbow, or totally multicolored if

DocID: 1jXlt - View Document

Microsoft Word - rainbow-potogold-coloring-card.doc

Microsoft Word - rainbow-potogold-coloring-card.doc

DocID: 148BX - View Document