On the chromatic number of circulant graphs (Q1045059): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.04.041 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.04.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137652538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sidon sets in groups and induced subgraphs of Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance graphs with maximum chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lonely runner with seven runners / 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: Circular chromatic numbers and fractional chromatic numbers of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture in diophantine approximations. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture in diophantine approximations. IV / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The view-obstruction problem for \(n\)-dimensional cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and spectral techniques for combinatorial problems on circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: View-obstruction problems. III / 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: The chromatic numbers of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring prime distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Graphs on the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planarity and colorability of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of integer distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional chromatic number and circular chromatic number for distance graphs with large clique size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum chromaticity of circulant graphs / 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: Distance graphs with finite chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760982 / 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: 4-colorable 6-regular toroidal graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number of distance graphs with distance sets of cardinality 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern periodic coloring of distance graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2008.04.041 / rank
 
Normal rank

Latest revision as of 14:39, 10 December 2024

scientific article
Language Label Description Also known as
English
On the chromatic number of circulant graphs
scientific article

    Statements

    On the chromatic number of circulant graphs (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    circulant graphs
    0 references
    chromatic number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers