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.
Similar content being viewed by others
References
E. Balas, andC.S. Yu: On graphs with polynomially solvable maximum-weight clique problem,Networks,19 (1989), 247–253.
R. P. Dilworth: A decomposition theorem for partially ordered sets,Ann. Math. 51 (1950), 161–166.
G. Ding: Graphs with not too many spanning trees,Networks,25 (1995), 193–197.
G. Ding Bounding the number of bases of a matroid,Combinatorica,15 (2) (1995), 159–165.
G. Ding: Excluding a long double path minor,J. Combinatorial Theory (B),66, (1) (1996), 11–23.