Karol Suchan, Ioan Todinca. Pathwidth of Circular-Arc Graphs. In Andreas Brandstädt, Dieter Kratsch, Haiko Müller, editors, Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Volume 4769 of Lecture Notes in Computer Science, pages 258-269, Springer, 2007. [doi]
@inproceedings{SuchanT07:0, title = {Pathwidth of Circular-Arc Graphs}, author = {Karol Suchan and Ioan Todinca}, year = {2007}, doi = {10.1007/978-3-540-74839-7_25}, url = {http://dx.doi.org/10.1007/978-3-540-74839-7_25}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/SuchanT07%3A0}, cites = {0}, citedby = {0}, pages = {258-269}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, editor = {Andreas Brandstädt and Dieter Kratsch and Haiko Müller}, volume = {4769}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-74838-0}, }