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

DOI10.1016/0020-0190(94)00202-AMaRDI QIDQ674176zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Cycles in weighted graphs
• Estimations for the number of cycles in a graph
• STACS 2005

Cited in

(4)

• On the number of circuits in regular matroids (with connections to lattices and codes)
• Isolating a vertex via lattices: polytopes with totally unimodular faces
• Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
• Isolating a vertex via lattices: polytopes with totally unimodular faces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674176)