| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428865 | Information Processing Letters | 2007 | 5 Pages |
Abstract
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such bases consist entirely of triangles.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
