default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 133
Volume 133, November 2018
- Iain Moffatt
, Ben Smith:
Matroidal frameworks for topological Tutte polynomials. 1-31 - Daniel W. Cranston, Landon Rabern:
Planar graphs are 9/2-colorable. 32-45 - Rong Chen, Jim Geelen:
Infinitely many excluded minors for frame matroids and for lifted-graphic matroids. 46-53 - Tao Jiang, Jie Ma:
Cycles of given lengths in hypergraphs. 54-77 - Rajko Nenadov:
Star-factors in graphs with large minimum degree. 78-87 - Andries E. Brouwer, Sebastian M. Cioaba, Ferdinand Ihringer, Matt McGinnis:
The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. 88-121 - Nathan J. Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz:
Non-reconstructible locally finite graphs. 122-152 - Frederik Garbe, Richard Mycroft:
Hamilton cycles in hypergraphs below the Dirac threshold. 153-210 - Guillem Perarnau, Will Perkins:
Counting independent sets in cubic graphs of given girth. 211-242 - Dan Hefetz, Mykhaylo Tyomkyn:
On the inducibility of cycles. 243-258
- Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl:
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. 259-260
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-01-03 23:26 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:
