189 citations · 506 across the 54 of their papers we have counts for
5 papers · 1 filter
Some Results on -Critical -Free Graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
A graph is -vertex-critical if has chromatic number but every proper induced subgraph of has chromatic number less than . The study of -vertex-critical gra…
New bounds for Ramsey numbers
Jan Goedgebeur, Steven Van Overberghe
Let denote the Ramsey number for the graphs , and let be . We present algorithms which enumerate all circulant and block-circulant Ramsey grap…
Colouring graphs with no induced six-vertex path or diamond
Jan Goedgebeur, Shenwei Huang, Yiao Ju +1
The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is (, diamond)-free if it contains no induced subgraph isomorphic to a six…
Switching 3-edge-colorings of cubic graphs
Jan Goedgebeur, Patric R. J. Östergård
The chromatic index of a cubic graph is either 3 or 4. Edge-Kempe switching, which can be used to transform edge-colorings, is here considered for 3-edge-colorings of cubic graphs.…
The Minimality of the Georges-Kelmans Graph
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
In 1971, Tutte wrote in an article that "it is tempting to conjecture that every 3-connected bipartite cubic graph is hamiltonian". Motivated by this remark, Horton constructed a c…