The following pages link to Günter Schaar (Q878647):
Displaying 50 items.
- (Q688690) (redirect page) (← links)
- Self-similarity in the combinatorial theory of orthogonal polynomials (Q688691) (← links)
- Colored species, \(c\)-monoids, and plethysm. I (Q690032) (← links)
- Pairs of trees in tree--tree triangulations (Q878648) (← links)
- A sufficient condition for a graph to contain two disjoint Hamiltonian cycles (Q915741) (← links)
- Two Hamilton cycles in bipartite reflective Kneser graphs (Q1112063) (← links)
- Explicit matchings in the middle levels of the Boolean lattice (Q1117950) (← links)
- Spanning Eulerian subgraphs and matchings (Q1124608) (← links)
- More powerful closure operations on graphs (Q1174165) (← links)
- Möbius species (Q1174751) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- Décompositions dans l'algèbre des différences divisées. (Decompositions in the algebra of divided differences) (Q1191951) (← links)
- On `maximal' Hamiltonian cycles in the square of a block (Q1309471) (← links)
- A statistical study of the Kostka-Foulkes polynomials (Q1312837) (← links)
- Conjectures on the quotient ring by diagonal invariants (Q1312993) (← links)
- Asymmetric structures, types, and indicator polynomials (Q1313380) (← links)
- Pancyclism and bipancyclism of Hamiltonian graphs (Q1322012) (← links)
- Remarks on Hamiltonian properties of powers of digraphs (Q1329819) (← links)
- Strong products of Kneser graphs (Q1336712) (← links)
- On a generalization of index series of species (Q1344227) (← links)
- Shift operators and factorial symmetric functions (Q1344229) (← links)
- Euler tours and a game with dominoes (Q1356489) (← links)
- Bounds on the number of knight's tours (Q1356517) (← links)
- On the Hamiltonicity exponent of directed cacti (Q1356716) (← links)
- An upper bound for the Hamiltonicity exponent of finite digraphs (Q1356721) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- On the number of Hamiltonian cycles of \(P_ 4\times{} P_ n\) (Q1813274) (← links)
- Hamiltonian cycles in bipartite graphs (Q1894704) (← links)
- On bandwidth and edgesum for the composition of two graphs (Q1897434) (← links)
- Dominating cycles in bipartite biclaw-free graphs (Q1903714) (← links)
- On the basis of the direct product of paths and wheels (Q1912343) (← links)
- Transition restricted Gray codes (Q1918866) (← links)
- Hamiltonicity exponent of digraphs (Q1921457) (← links)
- On traceable powers of digraphs (Q1970584) (← links)
- On special numberings of hypergraphs (Q1970719) (← links)
- (Q3222879) (← links)
- (Q3331248) (← links)
- (Q3734442) (← links)
- (Q3739146) (← links)
- (Q3768933) (← links)
- (Q3824341) (← links)
- Über zusammenhängende Graphen mitp-hamiltonscher (p + 1)-ter Potenz (p ≧ 4) (Q3855222) (← links)
- (Q3859801) (← links)
- (Q3874244) (← links)
- (Q3994394) (← links)
- Eine Charakterisierung der Graphen, deren dritte Potenz 2-hamiltonsch ist (Q4063491) (← links)
- (Q4106235) (← links)
- (Q4166782) (← links)
- (Q4518400) (← links)
