Sparse cycle bases for graphs with bounded genus

DOI10.1016/J.EJC.2026.104371MaRDI QIDQ7293100zbMATH OpenFDO

Authors Florian Lehner, Babak Miraftab

Publication date 9 July 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2026.104371

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites work

• A new upper bound of the basis number of the lexicographic product of graphs.
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• An Upper Bound on the Basis Number of the Powers of the Complete Graphs
• Bounds for the genus of graphs with given Betti number
• Dense minors in graphs of large girth
• Graph minors. XX: Wagner's conjecture
• scientific article; zbMATH DE number 2186995 (Why is no real title available?)
• scientific article; zbMATH DE number 3133252 (Why is no real title available?)
• scientific article; zbMATH DE number 1933070 (Why is no real title available?)
• scientific article; zbMATH DE number 862499 (Why is no real title available?)
• scientific article; zbMATH DE number 3024665 (Why is no real title available?)
• New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
• On the abstract properties of linear dependence.
• On the basis number of some complete bipartite graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• The basis number of a graph
• The Basis Number of Some Special Non-Planar Graphs
• The basis number of the \(n\)-cube
• The basis number of the composition of theta graphs with some graphs
• The cycle space of an embedded graph
• Union of all the minimum cycle bases of a graph
• When do short cycles generate the cycle space?

This page was built for publication: Sparse cycle bases for graphs with bounded genus

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