The following pages link to Equitable Coloring (Q4404923):
Displaying 16 items.
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- On equitable coloring of corona of wheels (Q5006590) (← links)
- Equitable chromatic number of weak modular product of Some graphs (Q5039443) (← links)
- On Equitable Coloring of Book Graph Families (Q5083494) (← links)
- Equitable edge coloring on tensor product of graphs (Q5083505) (← links)
- Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰ (Q5085697) (← links)
- On equitable chromatic number of Tadpole graph T_{m,n} (Q5085729) (← links)
- Equitably strong nonsplit equitable domination in graphs (Q5862618) (← links)
- Equitable oriented coloring (Q6047973) (← links)
- Equitable critical graphs (Q6059092) (← links)
- Injectively \(k\)-colored rooted forests (Q6063282) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
- New results on the robust coloring problem (Q6127005) (← links)
- A notion of vertex equitability for proper labellings (Q6153474) (← links)
- Secure equitability in graphs (Q6174164) (← links)
- Extremal numbers for disjoint copies of a clique (Q6202950) (← links)
