Union of all the minimum cycle bases of a graph

zbMath0885.05101MaRDI QIDQ1378498

Philippe Vismara

Publication date: 12 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227545

zbMATH Keywords

polynomial algorithmcycle basescyclic structuresrelevant cycle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Generating cycle spaces for graphs on surfaces with small genera ⋮ Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics ⋮ Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\) ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Gröbner bases and combinatorics for binary codes ⋮ Minimum Cycle Bases and Their Applications

This page was built for publication: Union of all the minimum cycle bases of a graph