Title

Bounding the number of circuits of a graph

Document Type

Article

Publication Date

1-1-1996

Abstract

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)

Combinatorica

First Page

331

Last Page

341

This document is currently not available here.

Share

COinS