H. Fleischner
Covering Graphs with Few Complete Bipartite Subgraphs
Fleischner, H.; Mujuni, E.; Paulusma, D.; Szeider, S.
Citation
Fleischner, H., Mujuni, E., Paulusma, D., & Szeider, S. (2007, December). Covering Graphs with Few Complete Bipartite Subgraphs. Presented at FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, New Delhi, India
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science |
Start Date | Dec 12, 2007 |
End Date | Dec 14, 2007 |
Publication Date | 2007 |
Deposit Date | Dec 21, 2014 |
Print ISSN | 0302-9743 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 4855 |
Pages | 340-351 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science |
ISBN | 978-3-540-77049-7 |
DOI | https://doi.org/10.1007/978-3-540-77050-3_28 |
Public URL | https://durham-repository.worktribe.com/output/1153058 |
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 © 2025
Advanced Search