The following pages link to Winfried Hochstättler (Q271596):
Displaying 50 items.
- Bicircular matroids are 3-colorable (Q271597) (← links)
- Towards a flow theory for the dichromatic number (Q322198) (← links)
- Semicircle law for a matrix ensemble with dependent entries (Q325914) (← links)
- Some heuristics for the binary paint shop problem and their expected number of colour changes (Q553962) (← links)
- On the combinatorics of Galois numbers (Q607017) (← links)
- The game chromatic index of wheels (Q643001) (← links)
- The neighborhood polynomial of chordal graphs (Q832856) (← links)
- Antisymmetric flows in matroids (Q852703) (← links)
- On the chromatic number of an oriented matroid (Q933674) (← links)
- (Q1125953) (redirect page) (← links)
- A pseudoconfiguration of points without adjoint (Q1125955) (← links)
- Large circuits in binary matroids of large cogirth. I (Q1127871) (← links)
- Large circuits in binary matroids of large cogirth. II (Q1272470) (← links)
- The nucleon of cooperative games and an algorithm for matching games (Q1290660) (← links)
- Scheduling trams in the morning (Q1299930) (← links)
- A lattice-theoretical characterization of oriented matroids (Q1362999) (← links)
- On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Complexity results on a paint shop problem. (Q1427181) (← links)
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions (Q1569057) (← links)
- Online matching on a line (Q1770389) (← links)
- Nested cones and onion skins (Q1802418) (← links)
- Hamiltonicity in graphs with few \(P_ 4\)'s (Q1805009) (← links)
- Matroid matching in pseudomodular lattices (Q1812751) (← links)
- Computational experience with general equilibrium problems (Q1814988) (← links)
- A note on maxflow-mincut and homomorphic equivalence in matroids (Q1840660) (← links)
- Note on the game chromatic index of trees (Q1884997) (← links)
- On pseudomodular matroids and adjoints (Q1894347) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- Generating convex polyominoes at random (Q1917521) (← links)
- The game chromatic number and the game colouring number of classes of oriented cactuses (Q1944077) (← links)
- Tree partitioning under constraints. -- Clustering for vehicle routing problems (Q1962035) (← links)
- In memoriam Walter Kern (Q1983102) (← links)
- The chromatic polynomial of a digraph (Q2056880) (← links)
- The star dichromatic number (Q2062686) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- Complete acyclic colorings (Q2185231) (← links)
- Joins of oriented matroids (Q2275473) (← links)
- The Varchenko determinant for oriented matroids (Q2332882) (← links)
- A flow theory for the dichromatic number (Q2403695) (← links)
- On a base exchange game on bispanning graphs (Q2448909) (← links)
- Steiner diagrams and \(k\)-star hubs (Q2466026) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- A note on the lattice of 2-matroid-intersections (Q2641310) (← links)
- The NL-flow polynomial (Q2664009) (← links)
- (Q2741322) (← links)
- (Q2741341) (← links)
- (Q2816021) (← links)
- The game colouring number of powers of forests (Q2831883) (← links)
- Balancing Covectors (Q3225122) (← links)
