Chong-Yun Chao

Available identifiers

zbMath Open chao.chong-yunMaRDI QIDQ1053706

List of research outcomes

Publication	Date of Publication	Type
An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers	2006-02-14	Paper
https://portal.mardi4nfdi.de/entity/Q4944609	2002-12-17	Paper
https://portal.mardi4nfdi.de/entity/Q3153543	2002-12-09	Paper
Uniquely \(n\)-colorable and chromatically equivalent graphs	2002-08-08	Paper
On the Toughness of Cycle Permutation Graphs	2001-12-16	Paper
On uniquely \(3\)-colorable graphs. II	2000-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q4367330	1998-03-02	Paper
A critically chromatic graph	1998-01-22	Paper
On \(q\)-graphs	1998-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q4880509	1996-08-21	Paper
Polynomials over finite fields which commute with a permutation polynomial	1994-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q4294580	1994-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q3137583	1993-12-20	Paper
On uniquely 3-colorable graphs	1993-08-30	Paper
https://portal.mardi4nfdi.de/entity/Q4031776	1993-04-22	Paper
On partitions of functions on finite sets	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q3989639	1992-06-28	Paper
Strongly equivalent classes of functions on finite sets	1990-01-01	Paper
On digraphs with circulant adjacent matrices	1990-01-01	Paper
Applications of Pólya's theorem to some classes of graphs	1989-01-01	Paper
A remark on symmetric circulant matrices	1988-01-01	Paper
On multinomial coefficients modulo a prime	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3794204	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3804709	1987-01-01	Paper
Onq-trees	1986-01-01	Paper
On trees of polygons	1985-01-01	Paper
Chromatic polynomials of connected graphs	1984-01-01	Paper
On generalized circulants over a Boolean algebra	1984-01-01	Paper
On labeled vertex-transitive digraphs with a prime number of vertices	1983-01-01	Paper
A note concerning chromatic polynomials	1983-01-01	Paper
On the semigroup of fully indecomposable relations	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3313882	1983-01-01	Paper
Generalizations of theorems of Wilson, Fermat and Euler	1982-01-01	Paper
On maximally saturated graphs	1982-01-01	Paper
On some sets of permutation matrices	1982-01-01	Paper
A class of vertex-transitive digraphs. II	1982-01-01	Paper
Equivalence classes of functions on finite sets	1982-01-01	Paper
On an extremal problem concerning the theory of graphs	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3922830	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3950675	1981-01-01	Paper
Chromaticity of self-complementary graphs	1979-01-01	Paper
Chromatically unique graphs	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3924332	1978-01-01	Paper
On chromatic equivalence of graphs	1978-01-01	Paper
Equalities and inequalities for ranks of modules	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4163401	1977-01-01	Paper
A generalization of a theorem of Boolean relation matrices	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4175779	1977-01-01	Paper
Subinvariance in Solvable Lie Algebras	1976-01-01	Paper
On nilpotent Lie algebras	1976-01-01	Paper
A test for conjugacy of partitions of finite sets	1974-01-01	Paper
A note on labeled symmetric graphs	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4049214	1974-01-01	Paper
A class of vertex-transitive digraphs	1973-01-01	Paper
On a type of circulants	1973-01-01	Paper
On the Radical of the Group Algebra of a p-Group Over a Modular Field	1972-01-01	Paper
A note on the eigenvalue of a graph	1971-01-01	Paper
On the Classification of Symmetric Graphs with a Prime Number of Vertices	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4081442	1967-01-01	Paper
On Groups and Graphs	1965-01-01	Paper
Uncountably many nonisomorphic nilpotent Lie algebras	1963-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Chong-Yun Chao