Hypercube subgraphs with minimal detours

DOI10.1002/(SICI)1097-0118(199610)23:2%3C119::AID-JGT3%3E3.0.CO;2-WMaRDI QIDQ4894615zbMATHOpenAlexFDO

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

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)

Recommendations

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

Cited in

(10)

• Sparse hypercube 3-spanners
• Bounded degree spanners of the hypercube
• Minimum cutsets in hypercubes
• Onk-detour subgraphs of hypercubes
• scientific article; zbMATH DE number 5844218 (Why is no real title available?)
• Detecting tampering in a random hypercube
• Long geodesics in subgraphs of the cube
• Some small sized spanning subgraphs of a hypercube
• Hypercube subgraphs with local detours
• On 2-detour subgraphs of the 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)