Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 150
Volume 150, September 2021
- Cai Heng Li
, Binzhou Xia, Sanming Zhou:
An explicit characterization of arc-transitive circulants. 1-16 - Joanna Polcyn, Christian Reiher, Vojtech Rödl, Bjarne Schülke:
On Hamiltonian cycles in hypergraphs with dense link graphs. 17-75 - Peter Nelson, Kazuhiro Nomoto:
The structure of claw-free binary matroids. 76-118 - Rogers Mathew, Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad:
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes. 119-143 - Edita Mácajová, Martin Skoviera:
Cubic graphs that cannot be covered with four perfect matchings. 144-176 - Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang:
Laminar tight cuts in matching covered graphs. 177-194 - Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. 195-243 - Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. 244-269 - Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. 270-304
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-17 21:16 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:
