On the boxicity of Kneser graphs and complements of line graphs (Q2689506): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Boxicity and Poset Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity and treewidth / 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: Computing the boxicity of a graph by covering its complement by cointerval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity of graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity of graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems concerning Kneser-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The order dimension of two levels of the Boolean lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimension of two levels of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better bounds for poset dimension and boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Robert's inequality for boxicity / rank
 
Normal rank

Revision as of 16:02, 31 July 2024

scientific article
Language Label Description Also known as
English
On the boxicity of Kneser graphs and complements of line graphs
scientific article

    Statements

    On the boxicity of Kneser graphs and complements of line graphs (English)
    0 references
    0 references
    0 references
    10 March 2023
    0 references
    boxicity
    0 references
    Kneser graphs
    0 references
    line graphs
    0 references

    Identifiers