default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 128
Volume 128, January 2018
- Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. 1-16 - Guoli Ding, Wenan Zang, Qiulan Zhao
:
On box-perfect graphs. 17-46 - Paul Balister, Hao Li, Richard H. Schelp:
Decompositions of graphs into cycles with chords. 47-65 - Chun-Hung Liu, Jie Ma:
Cycle lengths and minimum degree of graphs. 66-95 - Robert S. Coulter, Rex W. Matthews, Craig Timmons:
Planar polynomials and an extremal problem of Fischer and Matoušek. 96-103 - Nathan J. Bowler, Johannes Carmesin:
An excluded minors method for infinite matroids. 104-113 - Chun-Hung Liu, Sang-il Oum:
Partitioning H-minor free graphs into three subgraphs with no large components. 114-133 - Qinghai Liu, Xingxing Yu, Zhao Zhang:
Circumference of 3-connected cubic graphs. 134-159 - Ove Ahlman:
>k-homogeneous infinite graphs. 160-174 - Jie Han, Jaehoon Kim:
Two-regular subgraphs of odd-uniform hypergraphs. 175-191 - Carsten Thomassen:
The square of a planar cubic graph is 7-colorable. 192-218
- Ruth Luo:
The maximum number of cliques in graphs without long cycles. 219-226
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 2026-05-18 23:26 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:
