Not all graphs are segment T-graphs

DOI10.1016/S0195-6698(13)80050-9zbMATH Open0802.05075MaRDI QIDQ1813624FDOQ1813624

Authors: Noga Alon, Meir Katchalski, Edward Scheinerman 

Publication date: 25 June 1992

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Segment representation of a subclass of co-planar graphs
• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• scientific article; zbMATH DE number 1500690
• scientific article
• scientific article; zbMATH DE number 739017

zbMATH Keywords

line segments\(T\)-positionsegment \(T\)-graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Geometric permutations for convex sets
• The number of polytopes, configurations and real matroids
• Title not available (Why is that?)
• Lower Bounds for Approximation by Nonlinear Manifolds
• The Ramsey property for graphs with forbidden complete subgraphs
• Graphs which contain all small graphs
• On minimal n-universal graphs
• The number of submatrices of a given type in a Hadamard matrix and related results
• An upper bound for families of linearly related plane convex sets

Cited In (2)

• Crossing patterns of segments
• Crossing patterns of semi-algebraic sets

This page was built for publication: Not all graphs are segment \(T\)-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813624)