First Page | Document Content | |
---|---|---|
![]() Date: 2014-08-22 14:45:16Graph theory Graph coloring Rainbow coloring Edge coloring | Add to Reading List |
![]() | Rainbow copies of C4 in edge-colored hypercubes J. Balogh ∗ M. DelcourtDocID: 1qg2o - View Document |
![]() | 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 ofDocID: 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 ifDocID: 1jXlt - View Document |
![]() | Microsoft Word - rainbow-potogold-coloring-card.docDocID: 148BX - View Document |