Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)
From MaRDI portal
Publication:1682895
DOI10.1016/j.dam.2017.10.001zbMath1375.05150OpenAlexW2766420364MaRDI QIDQ1682895
Richard H. Hammack, Paul C. Kainen
Publication date: 6 December 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.001
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
A Family of Tree-Based Generators for Bubbles in Directed Graphs ⋮ A family of tree-based generators for bubbles in directed graphs ⋮ Graph bases and diagram commutativity
Cites Work
- A note on fundamental, non-fundamental, and robust cycle bases
- Union of all the minimum cycle bases of a graph
- Convex cycle bases
- On cycle bases of a graph
- Cycle construction and geodesic cycles with application to the hypercube
- A note on quasi-robust cycle bases
- Minimal cycle bases of the lexigraphic product of graphs
- An algorithm for the longest cycle problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)
