Bounding the number of circuits of a graph

DOI10.1007/BF01261319zbMath0863.05043OpenAlexW2065524011MaRDI QIDQ2563510

Guoli Ding

Publication date: 20 May 1997

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01261319

zbMATH Keywords

minorcircuitspolynomial functionpoly-class

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55)

Cites Work

• Excluding a long double path minor
• A decomposition theorem for partially ordered sets
• On graphs with polynomially solvable maximum-weight clique problem
• Graphs with not too many spanning trees
• Bounding the number of bases of a matroid