Hypercube subgraphs with minimal detours

DOI10.1002/(SICI)1097-0118(199610)23:2%3C119::AID-JGT3%3E3.0.CO;2-WzbMATH Open0857.05027OpenAlexW4254105230MaRDI QIDQ4894615FDOQ4894615

Authors: Peter Hamburger, William D. Weakley, Raymond E. Pippert 

Publication date: 26 February 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199610)23:2%3C119::aid-jgt3%3E3.0.co;2-w

Recommendations

• Hypercube subgraphs with local detours
• Onk-detour subgraphs of hypercubes
• On 2-detour subgraphs of the hypercube
• Hypercubes and Multicommodity Flows

zbMATH Keywords

distancehypercubesubgraphdetours

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cited In (10)

• Hypercube subgraphs with local detours
• Long geodesics in subgraphs of the cube
• Onk-detour subgraphs of hypercubes
• Minimum cutsets in hypercubes
• Some small sized spanning subgraphs of a hypercube
• Bounded degree spanners of the hypercube
• Sparse hypercube 3-spanners
• On 2-detour subgraphs of the hypercube
• Title not available (Why is that?)
• Detecting tampering in a random hypercube

This page was built for publication: Hypercube subgraphs with minimal detours

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