The following pages link to Gunnar Brinkmann (Q193543):
Displaying 50 items.
- (Q233427) (redirect page) (← links)
- Generation of various classes of trivalent graphs (Q391389) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Fusenes and benzenoids with perfect matchings (Q551857) (← links)
- Classification and generation of nanocones (Q642977) (← links)
- Posets on up to 16 points (Q698446) (← links)
- To be or not to be Yutsis: algorithms for the decision problem (Q709830) (← links)
- On the existence of nanojoins with given parameters (Q893213) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- Numbers of faces in disordered patches (Q1029734) (← links)
- GrInvIn in a nutshell (Q1029769) (← links)
- Generating water clusters and other directed graphs (Q1037502) (← links)
- PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration (Q1271874) (← links)
- Chromatic-index-critical graphs of orders 11 and 12 (Q1277310) (← links)
- 3- and 4-critical graphs of small even order (Q1357738) (← links)
- All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9 (Q1379130) (← links)
- Pentagon-hexagon-patches with short boundaries (Q1399690) (← links)
- The generation of maximal triangle-free graphs (Q1576571) (← links)
- Resonance graphs of catacondensed even ring systems are median (Q1613516) (← links)
- Grinberg's criterion (Q1621061) (← links)
- Polyhedra with few 3-cuts are Hamiltonian (Q1732035) (← links)
- Generating regular directed graphs (Q1759803) (← links)
- House of Graphs: a database of interesting graphs (Q1759891) (← links)
- The construction of cubic and quartic planar maps with prescribed face degrees (Q1811131) (← links)
- Face-spiral codes in cubic polyhedral graphs with face sizes no larger than 6 (Q1930473) (← links)
- An independent set approach for the communication network of the GPS III system (Q1941383) (← links)
- Ramsey numbers \(R(K_3, G)\) for graphs of order 10 (Q1953345) (← links)
- Counting symmetric configurations \(v_3\) (Q1962053) (← links)
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles (Q2048366) (← links)
- On 2-factors splitting an embedded graph into two plane graphs (Q2121487) (← links)
- Patches with short boundaries (Q2323104) (← links)
- Sizes of pentagonal clusters in fullerenes (Q2402936) (← links)
- Chromatic-index-critical graphs of orders 13 and 14 (Q2570100) (← links)
- Generation of simple quadrangulations of the sphere (Q2581402) (← links)
- Construction of planar triangulations with minimum degree 5 (Q2581624) (← links)
- Computing the maximal canonical form for trees in polynomial time (Q2636446) (← links)
- (Q2713660) (← links)
- (Q2741325) (← links)
- (Q2741326) (← links)
- (Q2741335) (← links)
- On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations (Q2825481) (← links)
- (Q3024021) (← links)
- (Q3369055) (← links)
- A simple and elementary proof of Whitney's unique embedding theorem (Q3390047) (← links)
- Construction of planar 4-connected triangulations (Q3465653) (← links)
- (Q3548359) (← links)
- (Q3655077) (← links)
- Nowhere-zero flows in low genus graphs (Q3784092) (← links)
- (Q3999887) (← links)
