Covering the complete graph with plane cycles

DOI10.1016/0166-218X(93)90239-KzbMath0794.05103OpenAlexW2052760659WikidataQ126838864 ScholiaQ126838864MaRDI QIDQ686275

Yoav Medan, Alan Hartman

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

coveringcomplete graphplane cycles

Mathematics Subject Classification ID

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

Cites Work

• Minimal coverings of pairs by triples
• Unnamed Item

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