|
|||||
|
|
Bounding the number of circuits of a graph |
|
| Authors: | Guoli Ding |
| Institution: | (1) Department of Mathematics, Louisiana State University, 70803-4918 Baton Rouge, LA |
| Abstract: | Letc(G) denote the number of circuits of a graphG. In this paper, we characterize those minor-closed classesG of graphs for which there is a polynomial functionp(.) such thatc(G) p(|E(G)|) for all graphsG inG. |
| Keywords: | 05 B 35 05 C 55 05 C 10 |
| 本文献已被 SpringerLink 等数据库收录！ | |