Minimum cycle bases of graphs over different fields

DOI10.1016/j.endm.2005.06.092zbMath1200.05119OpenAlexW1999714386MaRDI QIDQ3439388

J. D. Horton, Franziska Berger

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.092

Mathematics Subject Classification ID

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

Related Items (1)

Minimum Cycle Bases and Their Applications

Cites Work

• Unnamed Item
• Unnamed Item
• A greedy approach to compute a minimum cycle basis of a directed graph
• Minimum cycle bases for network graphs
• Degree-regular triangulations of torus and Klein bottle
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Cycle bases of graphs for sparse flexibility matrices
• A simple and general method for detecting structural inconsistencies in large electrical networks
• STACS 2005
• Algorithms - ESA 2003

This page was built for publication: Minimum cycle bases of graphs over different fields