How to make a graph four-connected

1999

Presented at the Connectivity augmentation of networks: structures and algorithms, Budapest

Additional Metadata
MSC	Connectivity (msc 05C40)
Publisher	Mathematical Programming Society
Journal	Mathematical Programming. A Publication of the Mathematical Programming Society
Conference	Connectivity augmentation of networks: structures and algorithms
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Győri, E., & Jordán, T. (1999). How to make a graph four-connected. In Mathematical Programming. A Publication of the Mathematical Programming Society (Vol. 84, pp. 555–563). Mathematical Programming Society.

Publication