Matchings and paths in the cube

DOI10.1016/S0166-218X(96)00076-5zbMath0879.05057OpenAlexW4210380771MaRDI QIDQ1363756

Imre Leader, Béla Bollobás

Publication date: 22 December 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

pathsmatchingsdirected paths\(n\)-cube

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

The Proofs of Two Directed Paths Conjectures of Bollobás and Leader ⋮ Antibandwidth of three-dimensional meshes ⋮ Research problems from the 19th British Combinatorial Conference ⋮ General lower bounds for the minor crossing number of graphs ⋮ A new lower bound for the bipartite crossing number with applications ⋮ Antibandwidth of Three-Dimensional Meshes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact face-isoperimetric inequalities
• On induced subgraphs of the cube
• A short proof for a theorem of Harper about Hamming-spheres
• A note on the edges of the n-cube
• Assignment of Numbers to Vertices
• Maximally Connected Arrays on the n-Cube
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Matchings and paths in the cube