Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 115
Volume 115, November 2015
- Sergey Norin, Liana Yepremyan
:
Sparse halves in dense triangle-free graphs. 1-25 - Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Coloring perfect graphs with no balanced skew-partitions. 26-65 - Zoltán Füredi:
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity. 66-71 - Genghua Fan, Yan Li, Ning Song, Daqing Yang:
Decomposing a graph into pseudoforests with one having bounded degree. 72-95 - Dániel T. Soukup:
Trees, ladders and graphs. 96-116 - Suijie Wang:
Möbius conjugation and convolution formulae. 117-131 - Wojciech Samotij, Benny Sudakov:
On the number of monotone sequences. 132-163 - Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov:
Comparable pairs in families of sets. 164-185 - Meysam Alishahi, Hossein Hajiabolhassan:
On the chromatic number of general Kneser hypergraphs. 186-209 - Zhibin Chen, Jie Ma, Wenan Zang:
Coloring digraphs with forbidden cycles. 210-223 - Dan McQuillan, Shengjun Pan, R. Bruce Richter:
On the crossing number of K13. 224-235 - Jie Ma, Humberto Naves:
Maximizing proper colorings on graphs. 236-275 - Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. 276-302 - Maria Chudnovsky, Katherine Edwards, Paul D. Seymour:
Edge-colouring eight-regular planar graphs. 303-338
- Alexey Pokrovskiy:
Highly linked tournaments. 339-347
a service of 
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-07-23 22:01 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:
