H.J. Broersma
On Coloring Graphs without Induced Forests
Broersma, H.J.; Golovach, P.A.; Paulusma, D.; Song, J.
Citation
Broersma, H., Golovach, P., Paulusma, D., & Song, J. (2010, December). On Coloring Graphs without Induced Forests. Presented at ISAAC 2010: Algorithms and Computation, Jeju Island, Korea
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | ISAAC 2010: Algorithms and Computation |
Start Date | Dec 15, 2010 |
End Date | Dec 17, 2010 |
Publication Date | 2010 |
Deposit Date | Dec 21, 2014 |
Peer Reviewed | Peer Reviewed |
Volume | 6507 |
Pages | 156-167 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | Algorithms and Computation |
ISBN | 978-3-642-17513-8 |
DOI | https://doi.org/10.1007/978-3-642-17514-5_14 |
Public URL | https://durham-repository.worktribe.com/output/1153019 |
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
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 © 2024
Advanced Search