default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 142
Volume 142, May 2020
- Patrizio Angelini
, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Simple k-planar graphs are simple (k + 1)-quasiplanar. 1-35 - Jim Geelen, Florian Hoersch:
Matroid fragility and relaxations of circuit hyperplanes. 36-42 - Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture. 43-55 - Asaf Ferber, Jacob Fox, Vishesh Jain:
Towards the linear arboricity conjecture. 56-79 - António Girão:
A large number of m-coloured complete infinite subgraphs. 80-105 - Dieter Mitsche, Michael Molloy, Pawel Pralat:
k-regular subgraphs near the k-core threshold of a random graph. 106-143 - Ahmad Abdi, Gérard Cornuéjols, Natália Guricanová, Dabeen Lee:
Cuboids, a class of clutters. 144-209 - Pablo Spiga:
On the existence of graphical Frobenius representations and their asymptotic enumeration. 210-243 - Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors II: Minimax relation. 244-275 - Wayne Barrett, Steve Butler, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader, Michael Young:
The inverse eigenvalue problem of a graph: Multiplicities and minors. 276-306 - Daniel Altman, Catherine S. Greenhill, Mikhail Isaev, Reshma Ramadurai:
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs. 307-373
- Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". 374-375
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-02-27 22:35 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:
