scientific article; zbMATH DE number 3896968
From MaRDI portal
Publication:3676164
Recommendations
- Disjoint edges in geometric graphs
- The chromatic number of the convex segment disjointness graph
- On geometric graphs with no two edges in convex position
- A Turán-type theorem on chords of a convex polygon
- On the connectivity of the disjointness graph of segments of point sets in general position in the plane
Cited in
(12)- A Turán-type theorem on chords of a convex polygon
- Intersection number of two connected geometric graphs
- A maximum b-matching problem arising from median location models with applications to the roommates problem
- Extremal problems for pairs of triangles
- Noncrossing monochromatic subtrees and staircases in 0-1 matrices
- Linear algebra approach to geometric graphs
- Saturation problems in convex geometric hypergraphs
- A note on light geometric graphs
- Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges
- scientific article; zbMATH DE number 5487968 (Why is no real title available?)
- Geometric graphs with no two parallel edges
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3676164)
