Jan Goedgebeur

From MaRDI portal
Person:396939

Available identifiers

zbMath Open goedgebeur.janWikidataQ49152776 ScholiaQ49152776MaRDI QIDQ396939

List of research outcomes

PublicationDate of PublicationType
K2‐Hamiltonian graphs: II2024-02-23Paper
The maximum number of connected sets in regular graphs2023-10-31Paper
A unified approach to construct snarks with circular flow number 52023-09-29Paper
Critical $(P_5,dart)$-Free Graphs2023-08-07Paper
Some results on \(k\)-critical \(P_5\)-free graphs2023-05-11Paper
Frank number and nowhere-zero flows on graphs2023-05-03Paper
Exact enumeration of fullerenes2023-04-04Paper
Colouring graphs with no induced six-vertex path or diamond2023-03-30Paper
Colouring graphs with no induced six-vertex path or diamond2023-01-04Paper
House of graphs 2.0: a database of interesting graphs and more2022-12-08Paper
Few hamiltonian cycles in graphs with one or two vertex degrees2022-11-15Paper
House of Graphs 2.0: a database of interesting graphs and more2022-10-31Paper
Switching 3-edge-colorings of cubic graphs2022-06-14Paper
The minimality of the Georges–Kelmans graph2022-04-13Paper
New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)2021-12-07Paper
Generation and properties of nut graphs2021-09-02Paper
\(k\)-critical graphs in \(P_5\)-free graphs2021-04-21Paper
\(k\)-critical graphs in \(P_5\)-free graphs2021-04-08Paper
Structural and computational results on platypus graphs2021-03-16Paper
Better 3-coloring algorithms: excluding a triangle and a seven vertex path2020-12-16Paper
Large independent sets in triangle-free cubic graphs: beyond planarity2020-10-20Paper
Computational results and new bounds for the circular flow number of snarks2020-08-12Paper
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs2020-07-17Paper
On minimal triangle‐free 6‐chromatic graphs2020-05-21Paper
The smallest nontrivial snarks of oddness 42020-03-23Paper
Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs2020-02-20Paper
Existence of regular nut graphs for degree at most 112020-02-17Paper
Obstructions for three-coloring graphs without induced paths on six vertices2020-01-15Paper
Graphs with few hamiltonian cycles2019-12-27Paper
On the minimum leaf number of cubic graphs2019-09-11Paper
On almost hypohamiltonian graphs2019-08-01Paper
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 442019-07-25Paper
Bounds for the smallest $k$-chromatic graphs of given girth2019-05-23Paper
On hypohamiltonian snarks and a theorem of Fiorini2018-08-03Paper
Obstructions for three-coloring graphs with one forbidden induced subgraph2018-07-16Paper
Infinitely many planar cubic hypohamiltonian graphs of girth 52018-07-13Paper
On the smallest snarks with oddness 4 and connectivity 22018-05-25Paper
A note on 2-bisections of claw-free cubic graphs2018-05-24Paper
Improved bounds for hypohamiltonian graphs2018-02-26Paper
Exhaustive generation of k‐critical ‐free graphs2018-02-23Paper
Generation of Cubic Graphs and Snarks with Large Girth2017-09-26Paper
Fullerenes with distant pentagons2017-07-19Paper
Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs2016-12-22Paper
Recursive generation of IPR fullerenes2015-09-28Paper
A counterexample to the pseudo 2-factor isomorphic graph conjecture2015-07-24Paper
Generation and properties of snarks2014-10-16Paper
The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)2014-08-14Paper
The Generation of Fullerenes2014-03-25Paper
Speeding up Martins' algorithm for multiple objective shortest path problems2014-03-24Paper
Ramsey numbers \(R(K_3, G)\) for graphs of order 102013-06-07Paper
New computational upper bounds for Ramsey numbers \(R(3,k)\)2013-06-07Paper
House of Graphs: a database of interesting graphs2012-11-22Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jan Goedgebeur