nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A New Proof of the Erdős–Simonovits Conjecture on Walks
|
Blekherman, Grigoriy |
|
|
39 |
3 |
|
artikel |
2 |
A Tight Linear Bound to the Chromatic Number of (P5,K1+(K1∪K3))-Free Graphs
|
Dong, Wei |
|
|
39 |
3 |
|
artikel |
3 |
Conflict-Free Connection Number of Graphs with Four Bridges
|
Li, Zhenzhen |
|
|
39 |
3 |
|
artikel |
4 |
Domino Tilings of Aztec Octagons
|
Kim, Hyunggi |
|
|
39 |
3 |
|
artikel |
5 |
Forbidding Couples of Tournaments and the Erdös–Hajnal Conjecture
|
Zayat, Soukaina |
|
|
39 |
3 |
|
artikel |
6 |
Gallai–Ramsey Numbers Involving a Rainbow 4-Path
|
Zou, Jinyu |
|
|
39 |
3 |
|
artikel |
7 |
Girth Conditions and Rota’s Basis Conjecture
|
Friedman, Benjamin |
|
|
39 |
3 |
|
artikel |
8 |
Minimally k-Factor-Critical Graphs for Some Large k
|
Guo, Jing |
|
|
39 |
3 |
|
artikel |
9 |
Minimum Separators and Menger’s Theorem
|
Joubbeh, Mouhamad El |
|
|
39 |
3 |
|
artikel |
10 |
Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs
|
Bui, Manh Vu |
|
|
39 |
3 |
|
artikel |
11 |
On Reconfiguration Graphs of Independent Sets Under Token Sliding
|
Avis, David |
|
|
39 |
3 |
|
artikel |
12 |
Paths are Turán-good
|
Gerbner, Dániel |
|
|
39 |
3 |
|
artikel |
13 |
Shadow Ratio of Hypergraphs with Bounded Degree
|
Jung, Attila |
|
|
39 |
3 |
|
artikel |
14 |
Sieve Methods in Random Graph Theory
|
Liu, Yu-Ru |
|
|
39 |
3 |
|
artikel |
15 |
Spectral Radius and Fractional Perfect Matchings in Graphs
|
Pan, Yingui |
|
|
39 |
3 |
|
artikel |
16 |
The Connectedness of the Friends-and-Strangers Graph of a Lollipop and Others
|
Wang, Lanchao |
|
|
39 |
3 |
|
artikel |
17 |
The Eulerian Distribution on k-Colored Involutions
|
Ma, Jun |
|
|
39 |
3 |
|
artikel |
18 |
The Explorer–Director Game on Graphs
|
Devlin, Pat |
|
|
39 |
3 |
|
artikel |
19 |
The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs
|
Lin, Yuquan |
|
|
39 |
3 |
|
artikel |
20 |
The Turán number of directed paths and oriented cycles
|
Zhou, Wenling |
|
|
39 |
3 |
|
artikel |
21 |
Three-Color Ramsey Number of an Odd Cycle Versus Bipartite Graphs with Small Bandwidth
|
You, Chunlin |
|
|
39 |
3 |
|
artikel |
22 |
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph
|
Hertz, Alain |
|
|
39 |
3 |
|
artikel |
23 |
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number
|
Long, Shude |
|
|
39 |
3 |
|
artikel |