The View-Obstruction Problem forn-Dimensional Cubes

1999/01/01 by Yong-Gao Chen, Thomas W. Cusick, T.W Cusick · 13 citations
Computer Science · Engineering · Mathematics · #Combinatorics #Computer science #Conjecture #Cube (algebra) #Integer (computer science) #Interconnection Networks and Systems #Mathematics #Optimization and Packing Problems #Prime (order theory) #graph theory and CDMA systems

paper · doi:10.1006/jnth.1998.2309

published in Journal of Number Theory 74(1), 126-133 (Elsevier BV)

crossref issued 1999/01/01 · crossref published 1999/01/01 · crossref published-print 1999/01/01 · openalex publication_date 1999/01/01 · crossref created 2002/09/18 · crossref deposited 2019/05/08 · openalex created_date 2025/10/10 · crossref indexed 2026/03/27 · openalex updated_date 2026/07/23

Citations

• Flows, View Obstructions, and the Lonely Runner
• View-obstruction problems, III
• View-obstruction problems
• Untere Schranken f�r zwei diophantische Approximations-Funktionen

Cited by

• On the chromatic number of circulant graphs
• Random runners are very lonely
• Invisible runners in finite fields
• The lonely runner problem for lacunary sequences
• Lonely runner conjecture [wikipedia]