The following pages link to Chong-Yun Chao (Q1053706):
Displayed 50 items.
- (Q790845) (redirect page) (← links)
- Chromatic polynomials of connected graphs (Q790846) (← links)
- On generalized circulants over a Boolean algebra (Q801999) (← links)
- Strongly equivalent classes of functions on finite sets (Q805748) (← links)
- On labeled vertex-transitive digraphs with a prime number of vertices (Q1053708) (← links)
- On trees of polygons (Q1063618) (← links)
- A remark on symmetric circulant matrices (Q1104384) (← links)
- On multinomial coefficients modulo a prime (Q1106847) (← links)
- On digraphs with circulant adjacent matrices (Q1123205) (← links)
- Applications of Pólya's theorem to some classes of graphs (Q1123209) (← links)
- On an extremal problem concerning the theory of graphs (Q1145157) (← links)
- Generalizations of theorems of Wilson, Fermat and Euler (Q1166551) (← links)
- On maximally saturated graphs (Q1169471) (← links)
- On some sets of permutation matrices (Q1169535) (← links)
- A class of vertex-transitive digraphs. II (Q1170197) (← links)
- Equivalence classes of functions on finite sets (Q1172057) (← links)
- On uniquely 3-colorable graphs (Q1210549) (← links)
- Chromaticity of self-complementary graphs (Q1252863) (← links)
- Chromatically unique graphs (Q1259606) (← links)
- Polynomials over finite fields which commute with a permutation polynomial (Q1320182) (← links)
- A critically chromatic graph (Q1366769) (← links)
- On \(q\)-graphs (Q1366792) (← links)
- On uniquely \(3\)-colorable graphs. II (Q1584365) (← links)
- Uniquely \(n\)-colorable and chromatically equivalent graphs (Q1608645) (← links)
- A note concerning chromatic polynomials (Q1837198) (← links)
- A test for conjugacy of partitions of finite sets (Q1844837) (← links)
- A note on labeled symmetric graphs (Q2265439) (← links)
- A note on the eigenvalue of a graph (Q2545101) (← links)
- A class of vertex-transitive digraphs (Q2555082) (← links)
- On a type of circulants (Q2556366) (← links)
- On the Toughness of Cycle Permutation Graphs (Q2760959) (← links)
- On the semigroup of fully indecomposable relations (Q3037673) (← links)
- (Q3137583) (← links)
- (Q3153543) (← links)
- (Q3313882) (← links)
- An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers (Q3366743) (← links)
- Onq-trees (Q3718732) (← links)
- (Q3794204) (← links)
- (Q3804709) (← links)
- (Q3922830) (← links)
- (Q3924332) (← links)
- (Q3950675) (← links)
- (Q3989639) (← links)
- On partitions of functions on finite sets (Q4009725) (← links)
- (Q4031776) (← links)
- Uncountably many nonisomorphic nilpotent Lie algebras (Q4041732) (← links)
- (Q4049214) (← links)
- Subinvariance in Solvable Lie Algebras (Q4065690) (← links)
- (Q4081442) (← links)
- On chromatic equivalence of graphs (Q4148003) (← links)