The interval count of interval graphs and orders: a short survey
Márcia R. Cerioli, Fabiano de Souza Oliveira, Jayme Luiz SZWARCFITER
Abstract
Open-access reader
Márcia R. Cerioli, Fabiano de Souza Oliveira, Jayme Luiz SZWARCFITER
Abstract
Open-access reader
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.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Interval (graph theory), Interval graph, Graph, Mathematics, Combinatorics, Interval data, Discrete mathematics, Statistics