Pages that link to "Item:Q5880941"
From MaRDI portal
The following pages link to On Finding Hamiltonian Cycles in Barnette Graphs (Q5880941):
Displaying 4 items.
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- Construction of Barnette graphs whose large subgraphs are non-Hamiltonian (Q2178486) (← links)
- Distance-two colourings of Barnette graphs (Q2225415) (← links)
- Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture (Q6055393) (← links)