default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 124
Volume 124, 2025
- Amena Assem, Marcel Koloschin, Max Pitz:
The Nash-Williams orientation theorem for graphs with countably many ends. 104043 - Milad Ahanjideh, Martin Milanic, Mary Servatius:
On balanceable and simply balanceable regular graphs. 104045 - Morgan Bauer, Keith Copenhaver:
A new lower bound for deterministic pop-stack-sorting. 104046 - Jacob A. White:
Chromatic quasisymmetric class functions for combinatorial Hopf monoids. 104055 - Matthias Hamann:
Quasi-transitive K∞-minor free graphs. 104056 - Venkata Raghu Tej Pantangi:
All 3-transitive groups satisfy the strict-Erdős-Ko-Rado property. 104057 - Binzhou Xia:
Graphical regular representations of (2,p)-generated groups. 104058 - Hyunwoo Lee:
Spanning subdivisions in dense digraphs. 104059 - Amritanshu Prasad, Samrith Ram:
Set partitions, tableaux, and subspace profiles under regular diagonal matrices. 104060 - Kazumasa Nomura, Paul M. Terwilliger:
Spin models and distance-regular graphs of q-Racah type. 104069 - Dániel Gerbner:
On non-degenerate Turán problems for expansions. 104071 - Sepehr Hajebi:
Induced subdivisions with pinned branch vertices. 104072 - T. Kyle Petersen, Yan Zhuang:
Zig-zag Eulerian polynomials. 104073 - Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole. 104074 - Ann Clifton, Éva Czabarka, Audace A. V. Dossou-Olory, Kevin Liu, Sarah Loeb, Utku Okur, László Székely, Kristina Wicke:
Decks of rooted binary trees. 104076
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 2024-10-07 01: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:
