No-three-in-line-in-3D
DOI10.1007/S00453-006-0158-9zbMATH Open1118.68106OpenAlexW2162369562MaRDI QIDQ879952FDOQ879952
Publication date: 10 May 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-0158-9
\(k\)-colourable graph[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=%5C%28k%5C%29-partite+Tur%EF%BF%BD%EF%BF%BDn+graph&go=Go \(k\)-partite Tur��n graph]
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (13)
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- On no-three-in-line problem on \(m\)-dimensional torus
- No-three-in-line for seventeen and nineteen
- No l Grid-Points in Spaces of Small Dimension
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- On general position sets in Cartesian products
- The general position problem on Kneser graphs and on some graph operations
- The general position number of Cartesian products involving a factor with small diameter
- Characterization of general position sets and its applications to cographs and bipartite graphs
- A note on the no-three-in-line problem on a torus
- Convex polygons in Cartesian products
- The extensible no-three-in-line problem
- On the general position number of two classes of graphs
This page was built for publication: No-three-in-line-in-3D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879952)