Graph avoidance in Hamilton laceable bipartite graphs: a sequel

MaRDI QIDQ2869403zbMATH OpenFDO

Authors Gustavus J. Simmons

Publication date 3 January 2014

Published in Congressus Numerantium (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Graph avoidance in Hamilton laceable bipartite graphs
• On edge extremal properties of Hamilton laceable bigraphs
• scientific article; zbMATH DE number 6490110
• Enumeration of Hamilton paths in ladders
• scientific article; zbMATH DE number 6692111

Cited in

(1)

• Graph avoidance in Hamilton laceable bipartite graphs

This page was built for publication: Graph avoidance in Hamilton laceable bipartite graphs: a sequel

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