Bounding the number of circuits of a graph
Let c(G) denote the number of circuits of a graph G. In this paper, we characterize those minor-closed classes script G sign of graphs for which there is a polynomial function p(.) such that c(G)≤p(\E(G)\) for all graphs G in script G sign.
Publication Source (Journal or Book title)
Ding, G. (1996). Bounding the number of circuits of a graph. Combinatorica, 16 (3), 331-341. https://doi.org/10.1007/BF01261319