The following pages link to Sándor Szabó (Q176454):
Displayed 50 items.
- Reducing graph coloring to clique search (Q326946) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- Full-rank factorings of elementary \(p\)-groups by \(Z\)-subsets. (Q740476) (← links)
- Multiple tilings by cubes with no shared faces (Q790820) (← links)
- Non-integer lattice tilings by (k,n) truncated crosses (Q791662) (← links)
- Polyhedra without diagonals (Q797148) (← links)
- A Hajós-Keller type result on factorization of finite cyclic groups (Q804709) (← links)
- Lattice covering by semicrosses of arm length 2 (Q804710) (← links)
- The number of distinct symbols in sections of rectangular arrays (Q819815) (← links)
- Abelian groups that cannot be factored without periodic factor. (Q879776) (← links)
- The possibility of extending factorization results to infinite Abelian groups. (Q880232) (← links)
- Multiple factorizations by cyclic subsets (Q915858) (← links)
- Affine regular polygons (Q950670) (← links)
- Rédei's theorem with a factor of order four. (Q1029966) (← links)
- Factoring an infinite Abelian group by lacunary cyclic subsets. (Q1041334) (← links)
- Polyhedra without diagonals. II (Q1046884) (← links)
- A reduction of lattice tiling by translates of a cubical cluster (Q1084677) (← links)
- Some problems on splittings of groups (Q1087644) (← links)
- Some special cases of Keller's conjecture (Q1094540) (← links)
- Item:Q176454 (redirect page) (← links)
- Nonequivalent splittings of Abelian groups (Q1106329) (← links)
- Keller's conjecture for certain p-groups (Q1109900) (← links)
- The Diophantine equation \(x^4+y^4= z^2\) in \(\mathbb Q(\sqrt{-2})\) (Q1125474) (← links)
- Cube tiling and covering a complete graph (Q1173697) (← links)
- On the algebraic form of Keller's conjecture (Q1179566) (← links)
- Factorization of periodic subsets (Q1187257) (← links)
- An extension for Hajós' theorem (Q1192615) (← links)
- Simulated factorizations (Q1204549) (← links)
- Cube tilings as contributions of algebra to geometry (Q1261217) (← links)
- A new proof of Rédei's theorem (Q1262950) (← links)
- Factoring elementary \(p\)-groups (Q1270404) (← links)
- Factoring by subsets of cardinality of prime power (Q1314886) (← links)
- An elementary proof for a result on simulated factoring (Q1320483) (← links)
- Factoring by subsets of cardinality prime or four (Q1322520) (← links)
- Hajós' theorem for multiple factorizations (Q1333056) (← links)
- Factoring by nonsubgroup factors (Q1339971) (← links)
- An axiomatic approach for the Hajós theorem (Q1368005) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- Hajós' theorem and the partition lemma. (Q1770345) (← links)
- A reduction of Keller's conjecture (Q1819376) (← links)
- On a problem of A. D. Sands (Q1825958) (← links)
- On the problem of regularity of a type of \(n\)-dimensional tilings (Q1839253) (← links)
- Factoring by simulated subsets (Q1895622) (← links)
- Greedy algorithms for triangle free coloring (Q1927697) (← links)
- Factoring groups having periodic maximal subgroups (Q1977164) (← links)
- Factoring by cyclic and simulated subsets (Q1977418) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- Metric space method for constructing splitting partitions of graphs (Q2178736) (← links)
- Estimating the fractional chromatic number of a graph (Q2236364) (← links)