E-LIB Suche - Ergebnisse für: Goedgebeur, Jan

1

Generation and new infinite families of K2-hypohamiltonian ..:

Goedgebeur, Jan ; Renders, Jarne ; Zamfirescu, Carol T.
Discrete Mathematics. 347 (2024) 7 - p. 113981 , 2024

Link: https://doi.org/10.1016/..

2

On the Frank Number and Nowhere-Zero Flows on Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Goedgebeur, Jan ; Máčajová, Edita ; Renders, Jarne - p. 363-375 , 2023

Link: https://doi.org/10.1007/..

3

A heuristic algorithm using tree decompositions for the max..:

Carpentier, Louis ; Jooken, Jorik ; Goedgebeur, Jan
Journal of Heuristics. 30 (2023) 1-2 - p. 67-107 , 2023

Link: https://doi.org/10.1007/..

4

Colouring graphs with no induced six-vertex path or diamond:

Goedgebeur, Jan ; Huang, Shenwei ; Ju, Yiao.
Theoretical Computer Science. 941 (2023) - p. 278-299 , 2023

Link: https://doi.org/10.1016/..

5

Critical $$(P_5,dart)$$-Free Graphs:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Xia, Wen ; Jooken, Jorik ; Goedgebeur, Jan. - p. 390-402 , 2023

Link: https://doi.org/10.1007/..

6

K2‐Hamiltonian graphs: II:

Goedgebeur, Jan ; Renders, Jarne ; Wiener, Gábor.
Journal of Graph Theory. 105 (2023) 4 - p. 580-611 , 2023

Link: https://doi.org/10.1002/..

7

House of Graphs 2.0: A database of interesting graphs and m..:

Coolsaet, Kris ; D'hondt, Sven ; Goedgebeur, Jan
Discrete Applied Mathematics. 325 (2023) - p. 97-107 , 2023

Link: https://doi.org/10.1016/..

8

Some results on k-critical P5-free graphs:

Cai, Qingqiong ; Goedgebeur, Jan ; Huang, Shenwei
Discrete Applied Mathematics. 334 (2023) - p. 91-100 , 2023

Link: https://doi.org/10.1016/..

9

New bounds for Ramsey numbers R(Kk−e,Kl−e):

Goedgebeur, Jan ; Van Overberghe, Steven
Discrete Applied Mathematics. 307 (2022) - p. 212-221 , 2022

Link: https://doi.org/10.1016/..

10

Switching 3-edge-colorings of cubic graphs:

Goedgebeur, Jan ; Östergård, Patric R.J.
Discrete Mathematics. 345 (2022) 9 - p. 112963 , 2022

Link: https://doi.org/10.1016/..

11

Evaluation of Directed Graph-Mapping in Complex Atrial Tach..:

Van Nieuwenhuyse, Enid ; Strisciuglio, Teresa ; Lorenzo, Giuseppe...
JACC: Clinical Electrophysiology. 7 (2021) 7 - p. 936-949 , 2021

Link: https://doi.org/10.1016/..

12

Colouring Graphs with No Induced Six-Vertex Path or Diamond:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Goedgebeur, Jan ; Huang, Shenwei ; Ju, Yiao. - p. 319-329 , 2021

Link: https://doi.org/10.1007/..

13

k-Critical graphs in P5-free graphs:

Cameron, Kathie ; Goedgebeur, Jan ; Huang, Shenwei.
Theoretical Computer Science. 864 (2021) - p. 80-91 , 2021

Link: https://doi.org/10.1016/..

14

Better 3-coloring algorithms: Excluding a triangle and a se..:

Bonomo-Braberman, Flavia ; Chudnovsky, Maria ; Goedgebeur, Jan...
Theoretical Computer Science. 850 (2021) - p. 98-115 , 2021

Link: https://doi.org/10.1016/..

15

Obstructions for three-coloring graphs without induced path..:

Chudnovsky, Maria ; Goedgebeur, Jan ; Schaudt, Oliver.
Journal of Combinatorial Theory, Series B. 140 (2020) - p. 45-83 , 2020

Link: https://doi.org/10.1016/..