Finding a shortest cycle in a subspace of the cycle space of a graph

DOI10.1016/j.amc.2015.06.053zbMath1410.05102OpenAlexW817709241MaRDI QIDQ668125

Han Ren, Ni Cao, Fugang Chao

Publication date: 18 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.053

zbMATH Keywords

embedded graphBFS tree3-path-conditionshort cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremality of degree-based graph entropies
• Embeddings of graphs with no short noncontractible cycles
• Finding short cycles in embedded graph in polynomial time
• The complexity of determining a shortest cycle of even length
• Weakly bipartite graphs and the max-cut problem
• Five-coloring maps on surfaces
• Minimal cycle bases of outerplanar graphs
• Minimum cycle bases of graphs on surfaces
• Strong Traces Model of Self-Assembly Polypeptide Structures
• On a conjecture about tricyclic graphs with maximal energy
• An algorithm for counting short cycles in bipartite graphs
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Finding Even Cycles Even Faster

This page was built for publication: Finding a shortest cycle in a subspace of the cycle space of a graph