L. Bulteau
Finding a small number of colourful components
Bulteau, L.; Dabrowski, K.K.; Fertin, G.; Johnson, M.; Paulusma, D.; Vialette, S.
Authors
K.K. Dabrowski
G. Fertin
Professor Matthew Johnson matthew.johnson2@durham.ac.uk
Head Of Department
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
S. Vialette
Citation
Bulteau, L., Dabrowski, K., Fertin, G., Johnson, M., Paulusma, D., & Vialette, S. (2019, December). Finding a small number of colourful components. Presented at CPM 2019, Pisa, Italy
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | CPM 2019 |
Acceptance Date | Mar 18, 2019 |
Publication Date | Jan 1, 2019 |
Deposit Date | Apr 7, 2019 |
Series Title | Leibniz international proceedings in informatics |
Series ISSN | 1868-8969 |
Book Title | 30th Annual Symposium on Combinatorial Pattern Matching |
Public URL | https://durham-repository.worktribe.com/output/1142914 |
Publisher URL | https://drops.dagstuhl.de/portals/lipics/index.php?semnr=16107 |
You might also like
Graph isomorphism for (H1,H2)-free graphs: an almost complete dichotomy
(2020)
Journal Article
Clique-width for graph classes closed under complementation
(2020)
Journal Article
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
(2020)
Journal Article
Clique-width and well-quasi ordering of triangle-free graph classes
(2019)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search