Testing bipartiteness of geometric intersection graphs
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Testing bipartiteness of geometric intersection graphs
- Efficient Algorithms for Geometric Graph Search Problems
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Geometric Intersection Graphs: Do Short Cycles Help?
- Intersection graphs of segments
Cited in
(6)- Edges and switches, tunnels and bridges
- 3-coloring arrangements of line segments with 4 slopes is hard
- Testing bipartiteness of geometric intersection graphs
- Maximum bipartite subgraphs of geometric intersection graphs
- Some properties of k-Delaunay and k-Gabriel graphs
- Maximum bipartite subgraph of geometric intersection graphs
This page was built for publication: Testing bipartiteness of geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501348)
