Person:396870

Available identifiers

zbMath Open chen.borliangMaRDI QIDQ396870

List of research outcomes

Publication	Date of Publication	Type
Equitable and \(m\)-bounded coloring of split graphs	2024-07-05	Paper
Equitable Coloring of Graphs with Intermediate Maximum Degree	2014-08-26	Paper
Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set	2014-08-14	Paper
Equivalence of two conjectures on equitable coloring of graphs	2013-06-13	Paper
A Common Generalization of the Theorems of Erd\H{o}s-Ko-Rado and Hilton-Milner	2013-04-06	Paper
Equitable \(\Delta\)-coloring of graphs	2012-04-30	Paper
Equitable coloring of interval graphs and products of graphs	2009-03-08	Paper
Chromatic coloring with a maximum color class	2009-01-28	Paper
The equitable colorings of Kneser graphs	2008-09-29	Paper
Near automorphisms of cycles	2008-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q4795850	2003-12-01	Paper
On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)	2002-08-29	Paper
Weighted decomposition construction for perfect secret sharing schemes	2002-08-15	Paper
Linear \(k\)-arboricities on trees	2001-04-09	Paper
A study of the total chromatic number of equibipartite graphs	2000-11-02	Paper
Total colorings of equibipartite graphs	2000-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q4373611	1999-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4697576	1995-08-27	Paper
Edge domination in complete partite graphs	1995-03-08	Paper
Equitable coloring of trees	1995-01-26	Paper
Equitable coloring and the maximum degree	1994-11-30	Paper
A note on the \(m\)-bounded chromatic number of a tree	1993-10-17	Paper
Two-dimensional cracks at an angle to an interface	1993-09-16	Paper
Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q4017192	1993-01-16	Paper
Diameters of iterated clique graphs of chordal graphs	1990-01-01	Paper
Hamiltonian uniform subset graphs	1987-01-01	Paper

Research outcomes over time

This page was built for person: Bor-Liang Chen