Diameters of uniform subset graphs (Q998410): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The diameter of a scale-free random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian uniform subset graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser graphs are Hamiltonian for \(n\geq 3k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free Hamiltonian Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of generalized Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of total domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum, the growth, and the diameter of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic numbers of some reduced Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of Kneser graphs / rank
 
Normal rank

Latest revision as of 00:07, 29 June 2024

scientific article
Language Label Description Also known as
English
Diameters of uniform subset graphs
scientific article

    Statements

    Identifiers