The following pages link to (Q3900101):
Displaying 5 items.
- Minimal hyper-Hamilton laceable graphs (Q1310244) (← links)
- Hyper-Hamilton laceable and caterpillar-spannable product graphs (Q1388980) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Bipartite independent number and Hamilton-biconnectedness of bipartite graphs (Q2657037) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
