default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 104
Volume 104, January 2014
- Daniela Kühn, Deryk Osthus:
Hamilton decompositions of regular expanders: Applications. 1-27 - Zdenek Dvorák
:
3-choosability of planar graphs with ( 4)-cycles far apart. 28-59 - Jonathan Cutler, A. J. Radcliffe:
The maximum number of complete subgraphs in a graph with given maximum degree. 60-71 - Oleg V. Borodin, Alexandr V. Kostochka:
Defective 2-colorings of sparse graphs. 72-80 - Imre Bárány, János Pach:
Homogeneous selections from hyperplanes. 81-87
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 2024-11-21 20:29 CET 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:
