Degree-constrained decompositions of graphs: boundered treewidth and planarity
Bazgan, C. and Tuza, Zsolt and Vanderpooten, D. (2006) Degree-constrained decompositions of graphs: boundered treewidth and planarity. Theoretical Computer Science, 355. pp. 389-395.
Full text not available from this repository.Item Type: | ISI Article |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Divisions: | Systems and Control Lab |
Depositing User: | Eszter Nagy |
Date Deposited: | 11 Dec 2012 15:26 |
Last Modified: | 11 Dec 2012 15:26 |
URI: | https://eprints.sztaki.hu/id/eprint/4423 |
Update Item |