$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and monopolar graphs are defined as $(\infty, \infty)$- and $(1...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2024-10-01
|
| Colección: | Discrete Mathematics & Theoretical Computer Science |
| Materias: | |
| Acceso en línea: | http://dmtcs.episciences.org/11479/pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|