Bipartite graphs with every matching in a cycle
type: Item
instance of: scholarly article
title: Bipartite graphs with every matching in a cycle
zbMATH Open document ID: 1117.05086
author: Grzegorz Gancarzewicz
author: Denise Amar
author: Evelyne Flandrin
author: Adam Paweł Wojda
published in: Discrete Mathematics
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5146853
zbMATH Keywords: Hamiltonian cycle
MaRDI profile type: Publication
full work available at URL: j.disc.2005.11.090
OpenAlex ID: W2067082140
cites work: Proof of a conjecture of Haeggkvist on cycles and independent edges
cites work: Q5422499
cites work: Q3912829
cites work: Cycles containing matchings and pairwise compatible euler tours
cites work: HAMILTONIAN CYCLES THROUGH MATCHINGS
DOI: 10.1016/J.DISC.2005.11.090
description: scientific article; zbMATH DE number 5146853