Robust cycle bases do not exist for K_n, n if n 8

DOI10.1016/J.DAM.2017.10.001MaRDI QIDQ1682895zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

bipartite graphcycle spaceHamiltonian cyclerobust cycle basis

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A note on fundamental, non-fundamental, and robust cycle bases
• A note on quasi-robust cycle bases
• Classification of robust cycle bases and relations to fundamental cycle bases
• Minimum weakly fundamental cycle bases are hard to find
• scientific article; zbMATH DE number 3853110
• On non-binomial structure of cyclic 8-roots
• On cycle frames with cycles of length 8
• scientific article; zbMATH DE number 1556749
• scientific article; zbMATH DE number 1760765
• scientific article; zbMATH DE number 5529057

Cites work

• A note on fundamental, non-fundamental, and robust cycle bases
• A note on quasi-robust cycle bases
• An algorithm for the longest cycle problem
• Convex cycle bases
• Cycle construction and geodesic cycles with application to the hypercube
• Graph cycles and diagram commutativity
• scientific article; zbMATH DE number 1833092 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3243268 (Why is no real title available?)
• scientific article; zbMATH DE number 2230298 (Why is no real title available?)
• Minimal cycle bases of the lexigraphic product of graphs
• Minimum cycle bases of direct products of bipartite graphs
• On cycle bases of a graph
• Union of all the minimum cycle bases of a graph

Cited in

(8)

• A note on fundamental, non-fundamental, and robust cycle bases
• Graph bases and diagram commutativity
• Minimum fundamental cycle basis of (n-2)-regular bipartite graphs with order 2n
• A note on quasi-robust cycle bases
• scientific article; zbMATH DE number 1563925 (Why is no real title available?)
• A Family of Tree-Based Generators for Bubbles in Directed Graphs
• A family of tree-based generators for bubbles in directed graphs
• Classification of robust cycle bases and relations to fundamental cycle bases

This page was built for publication: Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)

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