Regular chromatic number and the lonely runner problem (Q3503506): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3576683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untere Schranken für zwei diophantische Approximations-Funktionen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows, view obstructions, and the lonely runner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six lonely runners / rank
 
Normal rank
Property / cites work
 
Property / cites work: View-obstruction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: View-obstruction problems in \(n\)-dimensional geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: View-Obstruction Problems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: View-obstruction problems. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: View-obstruction: a shorter proof for 6 lonely runners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number of distance graphs with distance sets of cardinality 3 / rank
 
Normal rank

Revision as of 10:22, 28 June 2024

scientific article
Language Label Description Also known as
English
Regular chromatic number and the lonely runner problem
scientific article

    Statements

    Identifiers