Folgen
W.Cames van Batenburg
W.Cames van Batenburg
postdoc, TU Delft
Bestätigte E-Mail-Adresse bei tudelft.nl - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A tight Erdős-Pósa function for planar minors
W Cames van Batenburg, T Huynh, G Joret, JF Raymond
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
232019
Bipartite induced density in triangle-free graphs
W Cames van Batenburg, R de Joannis de Verclos, RJ Kang, F Pirot
The Electronic Journal of Combinatorics 27 (2), 19pp, 2020
15*2020
Squared chromatic number without claws or large cliques
W Cames van Batenburg, RJ Kang
Canadian Mathematical Bulletin 62 (1), 23-35, 2019
112019
Packing list‐colorings
S Cambie, W Cames van Batenburg, E Davies, RJ Kang
Random Structures & Algorithms 64 (1), 62-93, 2024
82024
The dimension of the incipient infinite cluster
W Cames van Batenburg
Electronic Communications in Probability 20 (33), 10pp, 2015
82015
Packing graphs of bounded codegree
W Cames van Batenburg, RJ Kang
Combinatorics, Probability and Computing 27 (5), 725-740, 2018
72018
Strong cliques and forbidden cycles
W Cames van Batenburg, RJ Kang, F Pirot
Indagationes Mathematicae 31 (1), 64-82, 2020
62020
Coloring Jordan regions and curves
W Cames van Batenburg, L Esperet, T Müller
SIAM Journal on Discrete Mathematics 31 (3), 1670-1684, 2017
6*2017
Large independent sets in triangle-free cubic graphs: beyond planarity
W Cames van Batenburg, J Goedgebeur, G Joret
Advances in Combinatorics 2020 (7), 45pp, 2020
5*2020
Disjoint list-colorings for planar graphs
S Cambie, WC van Batenburg, X Zhu
arXiv preprint arXiv:2312.17233, 2023
42023
Optimally reconfiguring list and correspondence colourings
S Cambie, WC van Batenburg, DW Cranston
European Journal of Combinatorics 115, 103798, 2024
32024
List packing number of bounded degree graphs
S Cambie, W Cames van Batenburg, E Davies, RJ Kang
arXiv preprint arXiv:2303.01246, 2023
32023
Strong chromatic index and Hadwiger number
W Cames van Batenburg, R de Joannis de Verclos, RJ Kang, F Pirot
Journal of Graph Theory 100 (3), 435-457, 2022
32022
Maximising line subgraphs of diameter at most
S Cambie, W Cames van Batenburg, R de Joannis de Verclos, RJ Kang
arXiv preprint arXiv:2103.11898, 2021
32021
Packing and covering balls in graphs excluding a minor
N Bousquet, W Cames van Batenburg, L Esperet, G Joret, W Lochet, ...
Combinatorica 41 (1), 2021
32021
Minimum maximal matchings in cubic graphs
W Cames van Batenburg
arXiv preprint arXiv:2008.01863, 2020
32020
Erdős-Pósa from ball packing
W Cames van Batenburg, G Joret, A Ulmer
SIAM Journal on Discrete Mathematics 34 (3), 1609–1619, 2020
3*2020
The Bollobás-Eldridge-Catlin conjecture for even girth at least
W Cames van Batenburg, RJ Kang
arXiv e-prints, arXiv: 1703.05149, 2017
3*2017
Structure and colour in triangle-free graphs
NR Aravind, S Cambie, W Cames van Batenburg, ...
arXiv preprint arXiv:1912.13328, 2019
22019
Almost sure bounds for the mass dimension and discrete Hausdorff dimension of the Incipient Infinite Cluster
W Cames van Batenburg
Master’s thesis, Leiden University, 2013
22013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20