default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 148
Volume 148, May 2021
- Archontia C. Giannopoulou
, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
A Menger-like property of tree-cut width. 1-22 - Xizhi Liu, Dhruv Mubayi:
The feasible region of hypergraphs. 23-59 - Charlotte Knierim, Pascal Su:
Kr-factors in graphs with low independence number. 60-83 - István Kovács, Young Soo Kwon:
Regular Cayley maps for dihedral groups. 84-124 - Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever:
Long cycles, heavy cycles and cycle decompositions in digraphs. 125-148 - Dong Yeap Kang, Jaehoon Kim, Hong Liu:
On the rational Turán exponents conjecture. 149-172 - Jan Kurkofka, Ruben Melcher, Max Pitz:
Approximating infinite graphs by normal trees. 173-183 - Michael Anastos, Alan M. Frieze:
A scaling limit for the length of the longest cycle in a sparse random graph. 184-208 - Armen S. Asratian, Jonas B. Granholm, Nikolay Khachatryan:
A localization method in Hamiltonian graph theory. 209-238 - Ervin Györi, Nathan Lemons, Nika Salia, Oscar Zamora:
The structure of hypergraphs without long Berge cycles. 239-250
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 2025-03-08 00:48 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:
