Covering the complete graph with plane cycles

DOI10.1016/0166-218X(93)90239-KMaRDI QIDQ686275zbMATH OpenOpenAlexWikidataFDO

Authors Alan Hartman, Yoav Medan

Publication date 28 August 1994

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(93)90239-k

zbMATH Keywords

complete graphcoveringplane cycles

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Let \(n\) vertices be distributed on the circumference of a circle in the plane. The authors determine, for each \(n\), the minimum number of cycles with no crossing edges such that every pair of vertices is adjacent on at least one cycle.

Recommendations

• scientific article; zbMATH DE number 1151791
• Covering a graph with cycles
• Covering Graphs by Cycles
• scientific article; zbMATH DE number 4061294
• scientific article; zbMATH DE number 4110709
• Approximately covering by cycles in planar graphs.
• Covering a graph with cycles passing through given edges
• Cycle covers of planar 2-edge-connected graphs
• Covering the vertices of a graph with cycles of bounded length
• scientific article; zbMATH DE number 871189

Cites work

• Graph theory
• Minimal coverings of pairs by triples

Cited in

(3)

• scientific article; zbMATH DE number 4194596 (Why is no real title available?)
• Covering a graph with cycles
• Trinque problem: covering complete graphs by plane degree-bounded hypergraphs

This page was built for publication: Covering the complete graph with plane cycles

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