The following pages link to Clemens Huemer (Q276214):
Displaying 50 items.
- The number of empty four-gons in random point sets (Q283694) (← links)
- The diameter of cyclic Kautz digraphs (Q322251) (← links)
- The edge rotation graph (Q367068) (← links)
- 4-labelings and grid embeddings of plane quadrangulations (Q418877) (← links)
- Production matrices for geometric graphs (Q510608) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Empty monochromatic triangles (Q833720) (← links)
- Connecting colored point sets (Q868381) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- Compatible geometric matchings (Q924079) (← links)
- The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Transforming spanning trees and pseudo-triangulations (Q1044747) (← links)
- Characteristic polynomials of production matrices for geometric graphs (Q1689984) (← links)
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity (Q1725794) (← links)
- New results on production matrices for geometric graphs (Q1792103) (← links)
- Token graphs (Q1926040) (← links)
- A combinatorial property on angular orders of plane point sets (Q1944953) (← links)
- On the Laplacian spectra of token graphs (Q2032264) (← links)
- On circles enclosing many points (Q2043403) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- Empty monochromatic simplices (Q2250050) (← links)
- The intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2279992) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Coloring decompositions of complete geometric graphs (Q2338577) (← links)
- Lower bounds on the maximum number of non-crossing acyclic graphs (Q2346577) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Matching points with disks with a common intersection (Q2421852) (← links)
- On the Fiedler value of large planar graphs (Q2435468) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Lower bounds for the number of small convex \(k\)-holes (Q2444312) (← links)
- 4-holes in point sets (Q2450200) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Triangulations without pointed spanning trees (Q2479476) (← links)
- On the number of edges in geometric graphs without empty triangles (Q2637713) (← links)
- New production matrices for geometric graphs (Q2666914) (← links)
- On maximum-sum matchings of points (Q2679241) (← links)
- 3-colorability of pseudo-triangulations (Q2792798) (← links)
- On the Fiedler value of large planar graphs (extended abstract) (Q2857328) (← links)
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons (Q3058550) (← links)
- (Q3391331) (← links)
- On embedding triconnected cubic graphs on point sets (Q3503515) (← links)
- (Q3575458) (← links)
- (Q3575470) (← links)
- On the number of plane graphs (Q3581579) (← links)
- (Q3625874) (← links)
- The diameter of cyclic Kautz digraphs (Q5023118) (← links)
- NOTE ON THE NUMBER OF OBTUSE ANGLES IN POINT SETS (Q5247060) (← links)
