default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 138
Volume 138, September 2019
- Dávid Kunszenti-Kovács
, László Lovász, Balázs Szegedy:
Measures on the square as sparse graph limits. 1-40 - Malgorzata Bednarska-Bzdega, Omri Ben-Eliezer, Lior Gishboliner, Tuan Tran:
On the separation conjecture in Avoider-Enforcer games. 41-77 - Fedor V. Fomin, Michal Pilipczuk:
On width measures and topological problems on semi-complete digraphs. 78-165 - Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu:
Coloring tournaments: From local to global. 166-171 - Ashwin Sah, Mehtaab Sawhney, David Stoner, Yufei Zhao:
The number of independent sets in an irregular graph. 172-195 - Charles Bordenave, Simon Coste:
Graphs with prescribed local neighborhoods of their universal coverings. 196-205 - Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter:
Separating tree-chromatic number from path-chromatic number. 206-218 - Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluded minors in cubic graphs. 219-285 - Peter Frankl, Andrey Kupavskii:
Two problems on matchings in set families - In the footsteps of Erdős and Kleitman. 286-313 - Penny Haxell, Michael Krivelevich, Gal Kronenberg:
Goldberg's conjecture is true for random multigraphs. 314-349
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-10-31 20:04 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:
