Minimum cycle bases of direct products of complete graphs
From MaRDI portal
Publication:846010
DOI10.1016/J.IPL.2006.12.012zbMATH Open1185.05088OpenAlexW2084571464MaRDI QIDQ846010FDOQ846010
Authors: Richard H. Hammack 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.012
Recommendations
Cites Work
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimum cycle bases of Halin graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal cycle bases of outerplanar graphs
- Minimum cycle bases of direct products of bipartite graphs
- On the basic number and the minimum cycle bases of the wreath product of some graphs I.
Cited In (16)
- Convex cycle bases
- Minimum cycle bases of the semi-strong product of paths and cycles with different ladders
- Cycle bases of reduced powers of graphs
- Title not available (Why is that?)
- Vertex vulnerability parameters of Kronecker products of complete graphs
- Minimum cycle bases of direct products of bipartite graphs
- Minimum fundamental cycle basis of some bipartite graphs
- Title not available (Why is that?)
- Minimum cycle basis of direct product of \(K_2 \times K_n\)
- Minimal cycle bases of the lexigraphic product of graphs
- Minimum cycle bases of direct products of graphs with cycles
- Minimum fundamental cycle basis of \((n-2)\)-regular bipartite graphs with order \(2n\)
- A note on quasi-robust cycle bases
- Graph cycles and diagram commutativity
- Minimum cycle bases of lexicographic products
- Minimum cycle bases of weighted outerplanar graphs
This page was built for publication: Minimum cycle bases of direct products of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846010)
