An Edge Coloring Problem for Graph Products

R. J. Faudree, András Gyárfás, R. H. Schelp

Research output: Contribution to journalArticle

Abstract

The edges of the Cartesian product of graphs G x H are to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H is 4- or 5-chromatic.

Original languageEnglish
Pages (from-to)297-302
Number of pages6
JournalJournal of Graph Theory
Volume23
Issue number3
DOIs
Publication statusPublished - Nov 1996

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'An Edge Coloring Problem for Graph Products'. Together they form a unique fingerprint.

  • Cite this