Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath0776.05062MaRDI QIDQ3991258

H. L. Abbott, Meir Katchalski

Publication date: 28 June 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cyclessnakesbox codes


Mathematics Subject Classification ID

Paths and cycles (05C38)


Related Items (11)

Isomorphism of maximum length circuit codes ⋮ The snake-in-the-box problem: A new upper bound ⋮ Covering the hypercube with a bounded number of disjoint snakes ⋮ On constructing snakes in powers of complete graphs ⋮ An upper bound on the size of the snake-in-the-box ⋮ On the asymptotic order of circuit codes ⋮ Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube ⋮ Unnamed Item ⋮ Bulky subgraphs of the hypercube ⋮ The maximum length of circuit codes with long bit runs and a new characterization theorem ⋮ Snakes, coils, and single-track circuit codes with spread \(k\)




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3991258&oldid=12054058"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki