Connectivity and diameter in distance graphs (Q3087615): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038646064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulants and their connectivities / 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: The chromatic numbers of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4483922 / 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: Fault-tolerant routings in double fixed-step networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementary survey on double-loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on multi-loop networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring of integer distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of circulant digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number of prime distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank
 
Normal rank

Latest revision as of 09:09, 4 July 2024

scientific article
Language Label Description Also known as
English
Connectivity and diameter in distance graphs
scientific article

    Statements

    Identifiers