Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger. Fully Decomposable Split Graphs. In Jirà Fiala, Jan KratochvÃl, Mirka Miller, editors, Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad MoravicÃ, Czech Republic, June 28-July 2, 2009, Revised Selected Papers. Volume 5874 of Lecture Notes in Computer Science, pages 105-112, Springer, 2009. [doi]
@inproceedings{BroersmaKW09,
title = {Fully Decomposable Split Graphs},
author = {Hajo Broersma and Dieter Kratsch and Gerhard J. Woeginger},
year = {2009},
doi = {10.1007/978-3-642-10217-2_13},
url = {http://dx.doi.org/10.1007/978-3-642-10217-2_13},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BroersmaKW09},
cites = {0},
citedby = {0},
pages = {105-112},
booktitle = {Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad MoravicÃ, Czech Republic, June 28-July 2, 2009, Revised Selected Papers},
editor = {Jirà Fiala and Jan KratochvÃl and Mirka Miller},
volume = {5874},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-10216-5},
}