Graph avoidance in Hamilton laceable bipartite graphs

MaRDI QIDQ2869402zbMATH 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: a sequel
• Hamiltonicity of bipartite biclaw-free graphs
• On Hamiltonian bipartite graphs
• scientific article; zbMATH DE number 5901724
• scientific article; zbMATH DE number 140139
• scientific article; zbMATH DE number 11998
• Hamiltonian cycles in bipartite graphs
• Line graphs of bipartite graphs with Hamiltonian paths
• scientific article; zbMATH DE number 1289752
• Hamilton-laceable bi-powers of locally finite bipartite graphs

Cited in

(3)

• Avoidance couplings on non‐complete graphs
• Graph avoidance in Hamilton laceable bipartite graphs: a sequel
• Addendum to: ``Hamilton-laceable bi-powers of locally finite bipartite graphs

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

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