The interval count of interval graphs and orders: a short survey
Márcia R. Cerioli, Fabiano de Souza Oliveira, Jayme Luiz SZWARCFITER · Journal of the Brazilian Computer Society · 2011
Abstract Theinterval count problemdetermines the smallest number of interval lengths needed in order to represent an interval model of a given interval graph or interval order. Despite the large number of studies about interval graphs and interval orders, surprisingly only a few results on the interval count problem are known. In this work, we provide a short survey about the interval count and related problems. a graph and the number of its maximal cliques.