default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 76
Volume 76, February 2019
- Hao Huang:
Two extremal problems on intersecting families. 1-9 - Martha Precup
, Julianna Tymoczko:
Springer fibers and Schubert points. 10-26 - Kolja Knauer, Petru Valicov:
Cuts in matchings of 3-connected cubic graphs. 27-36 - Péter Pál Pach, Csaba Sándor:
On infinite multiplicative Sidon sets. 37-52 - Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XI. Orientations. 53-61 - Jane Y. X. Yang:
Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem. 62-72 - Koji Momihara, Qing Xiang:
Constructions of skew Hadamard difference families. 73-81 - József Osztényi:
The neighborhood complexes of almost s-stable Kneser graphs. 82-87 - Zdenek Dvorák, Jordan Venters:
Triangle-free planar graphs with small independence number. 88-103 - Sakander Hayat, Jack H. Koolen, Muhammad Riaz:
A spectral characterization of the s-clique extension of the square grid graphs. 104-116 - Genghua Fan, Hongbi Jiang, Ping Li, Douglas B. West, Daqing Yang, Xuding Zhu:
Extensions of matroid covering and packing. 117-122 - Patrick Bennett, Louis DeBiasio, Andrzej Dudek, Sean English:
Large monochromatic components and long monochromatic cycles in random hypergraphs. 123-137 - Matthew Fayers:
Simultaneous core multipartitions. 138-158 - L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's conjecture for squares of 2-trees. 159-174 - Peter van Hintum, Piet Lammers:
The bunkbed conjecture on the complete graph. 175-177 - Joshua Hallam, Jeremy L. Martin, Bruce E. Sagan:
Increasing spanning forests in graphs and simplicial complexes. 178-198 - Jonathan Bloom, Dan Saracino:
On criteria for rook equivalence of Ferrers boards. 199-207
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-04-08 20:48 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:
