Bounding the number of circuits of a graph (Q2563510)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 958130
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the number of circuits of a graph |
scientific article; zbMATH DE number 958130 |
Statements
Bounding the number of circuits of a graph (English)
0 references
20 May 1997
0 references
Let \(c(G)\) be the number of circuits in a graph \(G\). A minor-closed class \(\Omega\) of graphs is called a poly-class if there exists a polynomial function \(p\) so that \(c(G)\leq p(|E(G) |)\) for every graph from \(\Omega\). It is shown that there is a simple characterization of poly-classes by means of forbidden families of graphs.
0 references
minor
0 references
circuits
0 references
poly-class
0 references
polynomial function
0 references
0.9579326
0 references
0.9192587
0 references
0.91499805
0 references
0.91459495
0 references
0.9143868
0 references
0.91254884
0 references
