A polynomial bound on the number of light cycles in an undirected graph

DOI10.1016/0020-0190(94)00202-AzbMath1034.68531OpenAlexW2068515762MaRDI QIDQ674176

Ashok Subramanian

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00202-a

zbMATH Keywords

undirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Unnamed Item ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

Cites Work

• Unnamed Item

This page was built for publication: A polynomial bound on the number of light cycles in an undirected graph