Subspace intersection graphs (Q712273)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Subspace intersection graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.disc.2010.06.042

0 references

Joshua D. Laison

0 references

0 references

Discrete Mathematics

0 references

publication date

28 October 2010

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

intersection graphs

0 references

affine dimension

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2010.06.042

0 references

0 references

0 references

Research Problems in Discrete Geometry

0 references

Every planar graph is the intersection graph of segments in the plane

0 references

Triangle-Free Planar Graphs and Segment Intersection Graphs

0 references

On grid intersection graphs

0 references

A combinatorial approach to complexity

0 references

Applications of matrix methods to the theory of lower bounds in computational complexity

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:712273

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q712273&oldid=35196520"