Homothetic polygons and beyond: maximal cliques in intersection graphs
type: Item
instance of: scholarly article
title: Homothetic polygons and beyond: maximal cliques in intersection graphs
zbMATH Open document ID: 1394.05106
author: Valentin E. Brimkov
author: Konstanty Junosza-Szaniawski
author: Sean Kafer
author: Jan Kratochvíl
author: Martin Pergel
author: Paweł Rzążewski
author: Matthew Szczepankiewicz
author: Joshua Terhaar
published in: Discrete Applied Mathematics
publication date: 2018-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6933519
zbMATH Keywords: geometric intersection graphs
zbMATH Keywords: \(P_{h o m}\) graphs
zbMATH Keywords: maximal clique
describes a project that uses: CLIP
MaRDI profile type: Publication
full work available at URL: j.dam.2018.03.046
OpenAlex ID: W2796591137
Wikidata QID: Q62595887
cites work: Q3514515
cites work: The clique problem in intersection graphs of ellipses and triangles
cites work: On a Coloring Problem.
cites work: Q3145799
cites work: On Intersection Graphs of Convex Polygons
cites work: The clique problem in ray intersection graphs
cites work: Arboricity and Subgraph Listing Algorithms
cites work: Unit disk graphs
cites work: The LBFS Structure and Recognition of Interval Graphs
cites work: Parameterized Algorithms
cites work: Fundamentals of parameterized complexity
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Algorithmic graph theory and perfect graphs
cites work: Q4828541
cites work: Data reduction and exact algorithms for clique cover
cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
cites work: Beyond Homothetic Polygons: Recognition and Maximum Clique
cites work: Max-tolerance graphs as intersection graphs
cites work: Q4657585
cites work: On intersection representations of co-planar graphs
cites work: Intersection graphs of segments
cites work: Q3348944
cites work: Intersection graphs of homothetic polygons
cites work: Algorithm Theory - SWAT 2004
cites work: Topics in Intersection Graph Theory
cites work: On cliques in graphs
cites work: Integer Representations of Convex Polygon Intersection Graphs
cites work: Q4871056
cites work: Robust algorithms for restricted domains
cites work: Q5588433
cites work: Efficient graph representations
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: Convex Polygon Intersection Graphs
cites work: On the dimension of a face exposed by proper separation of convex polyhedra
DBLP publication ID: journals/dam/BrimkovJKKPRST18
DOI: 10.1016/J.DAM.2018.03.046
Recommended article: Beyond Homothetic Polygons: Recognition and Maximum Clique
Recommended article: Intersection graphs of homothetic polygons
Recommended article: On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
Recommended article: On graphs whose maximal cliques and stable sets intersect
Recommended article: A characterization of intersection graphs of the maximal rectangles of a polyomino
Recommended article: Extremal graphs for intersecting cliques
Recommended article: The clique problem in intersection graphs of ellipses and triangles
Recommended article: On maximal cliques of polar graphs
Recommended article: Maximum cliques of hypergraphs and polynomial optimization
Recommended article: Intersection graphs of maximal hypercubes
description: scientific article; zbMATH DE number 6933519