Graphs with every matching contained in a cycle

DOI10.1016/0012-365X(93)90049-YzbMath0787.05074OpenAlexW2067675673MaRDI QIDQ685596

Abdelhamid Benhocine, Adam Paweł Wojda

Publication date: 19 May 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90049-y

zbMATH Keywords

cyclematchingminimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Proof of a conjecture of Haeggkvist on cycles and independent edges
• HAMILTONIAN CYCLES THROUGH MATCHINGS
• Cycles containing matchings and pairwise compatible euler tours
• Unnamed Item

This page was built for publication: Graphs with every matching contained in a cycle