Coloring of integer distance graphs (Q1584411): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LINEAR DIOPHANTINE EQUATION WITH APPLICATIONS TO NON‐NEGATIVE MATRICES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4005786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number of prime distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of special distance graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:06, 30 May 2024

scientific article
Language Label Description Also known as
English
Coloring of integer distance graphs
scientific article

    Statements

    Coloring of integer distance graphs (English)
    0 references
    0 references
    0 references
    2 November 2000
    0 references
    integer distance graph
    0 references
    chromatic number
    0 references

    Identifiers