|
|||||
|
|
A complete bipartite graph without properly colored cycles of length four |
|
| Authors: | Roman Čada Kenta Ozeki Kiyoshi Yoshimoto |
| Institution: | 1. Department of Mathematics, NTIS—New Technologies for the Information Society, University of West Bohemia, Pilsen, Czech Republic
CE-ITI—European Center of Excellence, University of West Bohemia, Pilsen, Czech Republic;2. Faculty of Environment and Information Sciences, Yokohama National University, Yokohama, Japan;3. Department of Mathematics, College of Science and Technology, Nihon University, Tokyo, Japan |
| Abstract: | |
| Keywords: | complete bipartite graph minimum color degree properly colored cycle |