default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 129
Volume 129, March 2018
- István Kovács
, Daniel Soltész:
Triangle-different Hamiltonian paths. 1-17 - Xing Peng:
On the decomposition of random hypergraphs. 18-37 - Zdenek Dvorák, Luke Postle:
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. 38-54 - Xi-Ming Cheng, Gary R. W. Greaves, Jack H. Koolen:
Graphs with three eigenvalues and second largest eigenvalue at most 1. 55-78 - Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Benjamin R. Smith:
Decompositions of complete multigraphs into cycles of varying lengths. 79-106 - Luke Postle:
Characterizing 4-critical graphs with Ore-degree at most seven. 107-147 - Carsten Thomassen:
Chords in longest cycles. 148-157 - Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in large 6-connected graphs. 158-203 - Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
A new proof of the flat wall theorem. 204-238
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:
