Vertebrate interval graphs
From MaRDI portal
Abstract: A vertebrate interval graph is an interval graph in which the maximum size of a set of independent vertices equals the number of maximal cliques. For any fixed , there is a polynomial-time algorithm for deciding whether a vertebrate interval graph admits a vertex partition into two induced subgraphs with claw number at most . In particular, when , whether a vertebrate interval graph can be partitioned into two proper interval graphs can be decided in polynomial time.
This page was built for publication: Vertebrate interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6378519)
