Subspace intersection graphs (Q712273): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3128962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is the intersection graph of segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Planar Graphs and Segment Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On grid intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial approach to complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of matrix methods to the theory of lower bounds in computational complexity / rank
 
Normal rank

Revision as of 09:02, 3 July 2024

scientific article
Language Label Description Also known as
English
Subspace intersection graphs
scientific article

    Statements

    Identifiers