| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949592 | Discrete Applied Mathematics | 2017 | 13 Pages |
Abstract
Moreover, we show that squares of P6-free graphs that have an e.d. are hole-free. Based on this result, we show that ED is solvable in polynomial time for (P6, net)-free graphs; again, the time bound for ED on this class is much better than in the P6-free case.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick,