Convex cycle bases

DOI10.26493/1855-3974.226.0A2MaRDI QIDQ3191452zbMATH OpenOpenAlexWikidataFDO

Authors Marc Hellmuth, Josef Leydold, Peter F. Stadler

Publication date 2 October 2014

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.226.0a2

zbMATH Keywords

Cartesian productconvex subgraphcycle basisisometric subgraphpartial cubes

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Minimum Cycle Bases in Graphs Algorithms and Applications
• Minimum Cycle Bases and Their Applications
• Minimum cycle bases of direct products of complete graphs
• scientific article; zbMATH DE number 1833092

Cited in

(5)

• Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)
• Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
• Planar median graphs and cubesquare-graphs
• A characterization of regular partial cubes whose all convex cycles have the same lengths
• Primitive, edge-short, isometric, and pantochordal cycles

This page was built for publication: Convex cycle bases

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