Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10858| Title: | Maximum-size subgraphs of P4-sparse graphs admitting a perfect matching |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | perfect graphs,p-4-sparse graphs,cographs,maximum-size subgraphs,maximum matchings,perfect matching,recognition algorithm,p-4-sparse graphs,cographs |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/10858 |
| ISSN: | 0302-9743 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nikolopoulos-2005-Maximum-size subgraphs of P4-sparse graphs admitting a perfect matching.pdf | 202.48 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
