Journal of Graph Theory · 1993 · 41 citations · 2 references
Natural SciencesMathematicsCombinatoricsComputational GeometryTopologyGeometric GraphsGraph ColoringGraph TheoryHypercube NetworksTopological CombinatoricsAcyclic HypergraphsColoring Planar Graphs
Abstract It is shown (for all n ≥ 3 ) that the edges of the n ‐cube can be 3‐colored in such a way that there is no monochromatic 4‐cycle or 6‐cycle. © 1993 John Wiley & Sons, Inc.
2
Subgraphs of a hypercube containing no small even cycles
Fan Chung · Journal of Graph Theory · 1992 · 58 citations