Raul Cordovil, David Forge, Sulamita Klein. How is a chordal graph like a supersolvable binary matroid?. Discrete Mathematics, 288(1-3):167-172, 2004. [doi]
@article{CordovilFK04,
title = {How is a chordal graph like a supersolvable binary matroid?},
author = {Raul Cordovil and David Forge and Sulamita Klein},
year = {2004},
doi = {10.1016/j.disc.2004.08.004},
url = {http://dx.doi.org/10.1016/j.disc.2004.08.004},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CordovilFK04},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {288},
number = {1-3},
pages = {167-172},
}