Laceable knights
From MaRDI portal
Publication:3466850
DOI10.26493/1855-3974.420.3c5zbMath1329.05177OpenAlexW4247591209WikidataQ129355247 ScholiaQ129355247MaRDI QIDQ3466850
Publication date: 25 January 2016
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.420.3c5
Hamiltonian pathsgeneralized Petersen graphsHamilton-connected graphtraceable graphHamilton-laceable graphknight graph
Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items
Dead ends on wreath products and lamplighter groups, Properties, proved and conjectured, of Keller, Mycielski, and queen graphs, Cayley graphs of order kp are hamiltonian for k < 48