default search action
Journal of Combinatorial Theory, Series B, Volume 141
Volume 141, March 2020
- Binzhou Xia
:
On cubic graphical regular representations of finite simple groups. 1-30 - Dong Yeap Kang
On 1-factors with prescribed lengths in tournaments. 31-71 - Jie Han, Andrew Treglown:
The complexity of perfect matchings and packings in dense hypergraphs. 72-104 - Olivier Durand de Gevigney:
On Frank's conjecture on k-connected orientations. 105-114 - Rose McCarty
7-Connected graphs are 4-ordered. 115-135 - Jun Gao
On a conjecture of Bondy and Vince. 136-142 - Xuding Zhu:
A refinement of choosability of graphs. 143-164 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. 165-180 - Tom Kelly
A local epsilon version of Reed's Conjecture. 181-222 - Yifan Jing
The genus of complete 3-uniform hypergraphs. 223-239 - Michael Dinitz
Approximate Moore Graphs are good expanders. 240-263 - Xujin Chen
Ranking tournaments with no errors I: Structural description. 264-294 - Nick Brettell
N-detachable pairs in 3-connected matroids I: Unveiling X. 295-342
- Carsten Thomassen
Factorizing regular graphs. 343-351
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-20 00:34 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: