Polarity on $H$-split graphs
Authors: F. Esteban Contreras Mendoza, César Hernández Cruz
Abstract: Given nonnegative integers, $s$ and $k$, an $(s,k)$-polar partition of a graph $G$ is a partition $(A,B)$ of $V_G$ such that $G[A]$ and $\overline{G[B]}$ are complete multipartite graphs with at most $s$ and $k$ parts, respectively. If $s$ or $k$ is replaced by $\infty$, it means that there is no restriction on the number of parts of $G[A]$ or $\overline{G[B]}$, respectively. A graph admitting a $(1,1)$-polar partition is usually called a split graph. In this work, we present some results related to $(s,k)$-polar partitions on two graph classes generalizing split graphs. Our main results include efficient algorithms to decide whether a graph on these classes admits an $(s,k)$-polar partition, as well as upper bounds for the order of minimal $(s,k)$-polar obstructions on such graph families for any $s$ and $k$ (even if $s$ or $k$ is $\infty$).
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant
Look for similar papers (in beta version)
By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.