Treewidth of circle graphs
- 1 January 1993
- book chapter
- Published by Springer Nature
- Vol. 7 (2) , 108-117
- https://doi.org/10.1007/3-540-57568-5_240
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Approximating treewidth and pathwidth of some classes of perfect graphsPublished by Springer Nature ,1992
- Achromatic number is NP-complete for cographs and interval graphsInformation Processing Letters, 1989
- Reducing prime graphs and recognizing circle graphsCombinatorica, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Finding a Maximum Planar Subset of a Set of Nets in a ChannelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Domination in permutation graphsJournal of Algorithms, 1985
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Reconnaissance des graphes de cordesDiscrete Mathematics, 1985
- Recognizing circle graphs in polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961