On rank-width of even-hole-free graphs
We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because chordal graphs are even-hole-free. A.A. da Silva, A. Silva and C. Linhares-Sales (2010) showed that planar even-hole-free g...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2017-10-01
|
| Colección: | Discrete Mathematics & Theoretical Computer Science |
| Materias: | |
| Acceso en línea: | https://dmtcs.episciences.org/2575/pdf |