default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 156
Volume 156, September 2022
- Vladimir P. Korzhik:
A simple proof of the Map Color Theorem for nonorientable surfaces. 1-17 - Andrey Kupavskii, Stefan Weltge
:
Binary scalar products. 18-30 - Jan Kurkofka, Ruben Melcher:
Countably determined ends and graphs. 31-56 - Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus:
Almost all optimally coloured complete graphs contain a rainbow Hamilton path. 57-100 - Johannes Carmesin:
Local 2-separators. 101-144 - Yan Cao, Guantao Chen, Songling Shan:
Overfullness of critical class 2 graphs with a small core degree. 145-173 - Peter Bradshaw:
On the hat guessing number of a planar graph class. 174-193 - Ronald J. Gould, Victor Larsen, Luke Postle:
Structure in sparse k-critical graphs. 194-222 - Amarja Kathapurkar, Richard Montgomery:
Spanning trees in dense directed graphs. 223-249 - Tereza Klimosová, Stéphan Thomassé:
Edge-partitioning 3-edge-connected graphs into paths. 250-293
- Zdenek Dvorák, Luke Postle:
Triangle-free planar graphs with at most 64n0.731 3-colorings. 294-298
- Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy:
The Turán number of blow-ups of trees. 299-309 - Mihyun Kang, Michael Missethan:
Concentration of maximum degree in random planar graphs. 310-342 - Freddie Illingworth:
The chromatic profile of locally bipartite graphs. 343-388 - János Pach, Gábor Tardos, Géza Tóth:
Crossings between non-homotopic edges. 389-404
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-05-05 20:55 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:
