Maximal non- hamilton-laceable graphs

DOI10.1002/jgt.3190050410zbMath0469.05046OpenAlexW2009684378WikidataQ105989556 ScholiaQ105989556MaRDI QIDQ3922714

Gustavus J. Simmons

Publication date: 1981

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190050410

zbMATH Keywords

complete bipartite graphHamilton connectedHamilton laceable

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Bipartite independent number and Hamilton-biconnectedness of bipartite graphs ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs

This page was built for publication: Maximal non- hamilton-laceable graphs