H.J. Broersma
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs
Broersma, H.J.; Golovach, P.A.; Paulusma, D.; Song, J.
Citation
Broersma, H., Golovach, P., Paulusma, D., & Song, J. (2010, June). Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. Presented at WG 2010: Graph-Theoretic Concepts in Computer Science, Zarós, Crete, Greece
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | WG 2010: Graph-Theoretic Concepts in Computer Science |
| Start Date | Jun 28, 2010 |
| End Date | Jun 30, 2010 |
| Publication Date | 2010 |
| Deposit Date | Dec 21, 2014 |
| Print ISSN | 0302-9743 |
| Publisher | Springer |
| Peer Reviewed | Peer Reviewed |
| Volume | 6410 |
| Pages | 63-74 |
| Series ISSN | 0302-9743,1611-3349 |
| Book Title | Graph Theoretic Concepts in Computer Science |
| ISBN | 978-3-642-16925-0 |
| DOI | https://doi.org/10.1007/978-3-642-16926-7_8 |
| Public URL | https://durham-repository.worktribe.com/output/1154398 |
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