%0 Journal Article %1 journals/jgt/Birmele08 %A Birmelé, Etienne %D 2008 %J J. Graph Theory %K dblp %N 4 %P 293-298 %T Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord. %U http://dblp.uni-trier.de/db/journals/jgt/jgt58.html#Birmele08 %V 58

@article{journals/jgt/Birmele08, added-at = {2020-10-02T00:00:00.000+0200}, author = {Birmelé, Etienne}, biburl = {https://www.bibsonomy.org/bibtex/2568f0368aa246a6e45e4e6d10220fe40/dblp}, ee = {https://doi.org/10.1002/jgt.20312}, interhash = {c135f96b40e8ff8c134ea026d2d36c6f}, intrahash = {568f0368aa246a6e45e4e6d10220fe40}, journal = {J. Graph Theory}, keywords = {dblp}, number = 4, pages = {293-298}, timestamp = {2020-10-03T11:48:51.000+0200}, title = {Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord.}, url = {http://dblp.uni-trier.de/db/journals/jgt/jgt58.html#Birmele08}, volume = 58, year = 2008 }