Minimum cycle bases of direct products of complete graphs

DOI10.1016/j.ipl.2006.12.012zbMath1185.05088OpenAlexW2084571464MaRDI QIDQ846010

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

zbMATH Keywords

combinatorial problemstrianglesminimum cycle basisdirect product of graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Minimum cycle bases of weighted outerplanar graphs ⋮ Minimum fundamental cycle basis of some bipartite graphs ⋮ Minimum cycle basis of direct product of \(K_2 \times K_n\) ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs

Cites Work

• Minimal cycle bases of outerplanar graphs
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Minimum cycle bases of Halin graphs
• On the basic number and the minimum cycle bases of the wreath product of some graphs I.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum cycle bases of direct products of complete graphs