The following pages link to Bor-Liang Chen (Q396870):
Displaying 24 items.
- Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set (Q396872) (← links)
- Equitable \(\Delta\)-coloring of graphs (Q411652) (← links)
- A note on the \(m\)-bounded chromatic number of a tree (Q685308) (← links)
- The equitable colorings of Kneser graphs (Q947040) (← links)
- Chromatic coloring with a maximum color class (Q998433) (← links)
- (Q1071030) (redirect page) (← links)
- Hamiltonian uniform subset graphs (Q1071032) (← links)
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563) (← links)
- Two-dimensional cracks at an angle to an interface (Q1261695) (← links)
- Total colorings of equibipartite graphs (Q1297471) (← links)
- Equitable coloring of trees (Q1328387) (← links)
- Edge domination in complete partite graphs (Q1336647) (← links)
- Equitable coloring and the maximum degree (Q1337614) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- A study of the total chromatic number of equibipartite graphs (Q1584229) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\) (Q1613526) (← links)
- Equivalence of two conjectures on equitable coloring of graphs (Q1956256) (← links)
- Near automorphisms of cycles (Q2469986) (← links)
- Diameters of iterated clique graphs of chordal graphs (Q3348015) (← links)
- (Q4017192) (← links)
- (Q4373611) (← links)
- (Q4697576) (← links)
- (Q4795850) (← links)
