Homothetic polygons and beyond: maximal cliques in intersection graphs
DOI10.1016/J.DAM.2018.03.046zbMATH Open1394.05106DBLPjournals/dam/BrimkovJKKPRST18OpenAlexW2796591137WikidataQ62595887 ScholiaQ62595887MaRDI QIDQ1671346FDOQ1671346
Authors: Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Paweł Rzążewski, Matthew Szczepankiewicz, Joshua Terhaar 
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.046
Recommendations
- Beyond homothetic polygons: recognition and maximum clique
- Intersection graphs of homothetic polygons
- On max-clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
- On graphs whose maximal cliques and stable sets intersect
- A characterization of intersection graphs of the maximal rectangles of a polyomino
- Extremal graphs for intersecting cliques
- The clique problem in intersection graphs of ellipses and triangles
- On maximal cliques of polar graphs
- Maximum cliques of hypergraphs and polynomial optimization
- Intersection graphs of maximal hypercubes
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Fundamentals of parameterized complexity
- Title not available (Why is that?)
- Topics in Intersection Graph Theory
- Unit disk graphs
- Efficient graph representations
- Algorithmic graph theory and perfect graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- Title not available (Why is that?)
- Parameterized algorithms
- On cliques in graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Intersection graphs of segments
- On intersection representations of co-planar graphs
- The clique problem in ray intersection graphs
- On intersection graphs of convex polygons
- Intersection graphs of homothetic polygons
- On a Coloring Problem.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Arboricity and Subgraph Listing Algorithms
- The worst-case time complexity for generating all maximal cliques and computational experiments
- The LBFS structure and recognition of interval graphs
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Title not available (Why is that?)
- Max-tolerance graphs as intersection graphs
- Title not available (Why is that?)
- Algorithm Theory - SWAT 2004
- The clique problem in intersection graphs of ellipses and triangles
- Data reduction and exact algorithms for clique cover
- State of the union (of geometric objects)
- Robust algorithms for restricted domains
- On the dimension of a face exposed by proper separation of convex polyhedra
- Convex Polygon Intersection Graphs
- Beyond homothetic polygons: recognition and maximum clique
- Integer representations of convex polygon intersection graphs
Cited In (9)
- Intersection graphs of homothetic polygons
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
- Maximal intersecting families and affine regular polygons in \(PG(2,q)\)
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Generalized octahedra and cliques in intersection graphs of uniform hypergraphs
- Distinguishing classes of intersection graphs of homothets or similarities of two convex disks
- On intersection graphs of convex polygons
- Beyond homothetic polygons: recognition and maximum clique
- On max-clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
Uses Software
This page was built for publication: Homothetic polygons and beyond: maximal cliques in intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671346)
