default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 65
Volume 65, October 2017
- Tony Huynh
, Sang-il Oum, Maryam Verdian-Rizi:
Even-cycle decompositions of graphs with no odd-K4-minor. 1-14 - Sizhong Zhou, Zhiren Sun, Zurun Xu:
A result on r-orthogonal factorizations in digraphs. 15-23 - Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Minimal complexity of equidistributed infinite permutations. 24-36 - Zoltán Blázsik, Zoltán Lóránt Nagy:
Partition dimension of projective planes. 37-44 - Haimiao Chen:
Quotients of polynomial rings and regular t-balanced Cayley maps on abelian groups. 45-58 - Nicolas Bonichon, Mireille Bousquet-Mélou, Paul Dorbec, Claire Pennarun:
On the number of planar Eulerian orientations. 59-91 - Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela:
On growth and fluctuation of k-abelian complexity. 92-105 - Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
Minors in graphs of large ϴr-girth. 106-121 - Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
DP-colorings of graphs with high chromatic number. 122-129 - Nathan Lindzey:
Erdős-Ko-Rado for perfect matchings. 130-142 - Vadim V. Lozin, Viktor Zamaraev:
The structure and the number of P7-free bipartite graphs. 143-153 - Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and covering immersion-expansions of planar sub-cubic graphs. 154-167 - Steve Butler, Ron Graham, Catherine H. Yan:
Parking distributions on trees. 168-185 - Neslihan Gügümcü, Louis H. Kauffman:
New invariants of knotoids. 186-229 - Felix Breuer, Dennis Eichhorn, Brandt Kronholm:
Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts. 230-252 - Ferenc Bencs:
One more remark on the adjoint polynomial. 253-258 - André Kündgen, Binlong Li, Carsten Thomassen:
Cycles through all finite vertex sets in infinite graphs. 259-275 - Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs I. 276-287 - Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs II. 288-301
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-12-04 22:08 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:
