Explicit construction of linear sized tolerant networks. (Reprint) (Q2498004): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey number of paths, trees, and circuits. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Graphs for Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse graphs with dense long paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size Ramsey numbers involving stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Model for Fault-Tolerant Computing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MinimumK-hamiltonian graphs / rank
 
Normal rank

Latest revision as of 18:43, 24 June 2024

scientific article
Language Label Description Also known as
English
Explicit construction of linear sized tolerant networks. (Reprint)
scientific article

    Statements