Not all graphs are segment \(T\)-graphs
From MaRDI portal
Publication:1813624
DOI10.1016/S0195-6698(13)80050-9zbMath0802.05075MaRDI QIDQ1813624
Edward R. Scheinerman, Meir Katchalski, Noga Alon
Publication date: 25 June 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (2)
Cites Work
- Unnamed Item
- An upper bound for families of linearly related plane convex sets
- The number of submatrices of a given type in a Hadamard matrix and related results
- Graphs which contain all small graphs
- The Ramsey property for graphs with forbidden complete subgraphs
- Geometric permutations for convex sets
- The number of polytopes, configurations and real matroids
- On minimal n-universal graphs
- Lower Bounds for Approximation by Nonlinear Manifolds
This page was built for publication: Not all graphs are segment \(T\)-graphs