The following pages link to Jan Goedgebeur (Q396939):
Displaying 46 items.
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) (Q396940) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Recursive generation of IPR fullerenes (Q498482) (← links)
- Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
- A note on 2-bisections of claw-free cubic graphs (Q1752606) (← links)
- On the smallest snarks with oddness 4 and connectivity 2 (Q1753089) (← links)
- House of Graphs: a database of interesting graphs (Q1759891) (← links)
- Ramsey numbers \(R(K_3, G)\) for graphs of order 10 (Q1953345) (← links)
- New computational upper bounds for Ramsey numbers \(R(3,k)\) (Q1953415) (← links)
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\) (Q2057608) (← links)
- House of graphs 2.0: a database of interesting graphs and more (Q2104929) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- Existence of regular nut graphs for degree at most 11 (Q2296003) (← links)
- The smallest nontrivial snarks of oddness 4 (Q2306590) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- A counterexample to the pseudo 2-factor isomorphic graph conjecture (Q2354717) (← links)
- Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
- Structural and computational results on platypus graphs (Q2656702) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Colourings of cubic graphs inducing isomorphic monochromatic subgraphs (Q3299215) (← links)
- Infinitely many planar cubic hypohamiltonian graphs of girth 5 (Q4575516) (← links)
- Obstructions for three-coloring graphs with one forbidden induced subgraph (Q4575707) (← links)
- On hypohamiltonian snarks and a theorem of Fiorini (Q4577866) (← links)
- Exhaustive generation of <i>k</i>‐critical ‐free graphs (Q4604026) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- Generation and properties of nut graphs (Q4956530) (← links)
- The minimality of the Georges–Kelmans graph (Q5070550) (← links)
- On minimal triangle‐free 6‐chromatic graphs (Q5110643) (← links)
- Large independent sets in triangle-free cubic graphs: beyond planarity (Q5126758) (← links)
- Graphs with few hamiltonian cycles (Q5207451) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- On almost hypohamiltonian graphs (Q5226849) (← links)
- Fullerenes with distant pentagons (Q5279164) (← links)
- Generation of Cubic Graphs and Snarks with Large Girth (Q5360888) (← links)
- Bounds for the smallest $k$-chromatic graphs of given girth (Q5377231) (← links)
- The Generation of Fullerenes (Q5403062) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
- A unified approach to construct snarks with circular flow number 5 (Q6055928) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
- <i>K</i><sub>2</sub>‐Hamiltonian graphs: II (Q6199383) (← links)
