default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 105
Volume 105, March 2014
- Christian Reiher
:
Counting odd cycles in locally dense graphs. 1-5
- Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. 6-10 - Maria Chudnovsky, Paul D. Seymour:
Extending the Gyárfás-Sumner conjecture. 11-16 - Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti:
Packing of rigid spanning subgraphs and spanning trees. 17-25 - Jialong Cheng, Sitharam Meerea:
Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid. 26-43 - Maria Chudnovsky, Paul D. Seymour:
Rao's degree sequence conjecture. 44-92 - Florian Lehner:
On spanning tree packings of highly edge connected graphs. 93-126
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-20 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
