Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Connectivity of Knight's Graphs

From MaRDI portal
Publication:4287041
Jump to:navigation, search

DOI10.1112/PLMS/S3-67.2.225zbMATH Open0797.05059OpenAlexW2029745650MaRDI QIDQ4287041FDOQ4287041


Authors: Frank Rhodes, Steve Wilson Edit this on Wikidata


Publication date: 10 October 1994

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-67.2.225




Recommendations

  • scientific article; zbMATH DE number 1011083
  • Laceable knights
  • Knight's moves, graphs, and lattices
  • Efficient domination in knights graphs
  • scientific article; zbMATH DE number 3853116


zbMATH Keywords

connectivitygeneralized Knight's graphs


Mathematics Subject Classification ID

Connectivity (05C40)



Cited In (3)

  • Knights are 24/13 times faster than the king
  • Digital metrics generated by families of paths
  • Title not available (Why is that?)





This page was built for publication: Connectivity of Knight's Graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4287041&oldid=18213185"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 18:40. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki