| 单词 |
reducible configuration |
| 释义 |
reducible configuration reducible configuration[ri′dü·sə·bəl kən‚fig·yə′rā·shən] (mathematics) A graph such that the four-colorability of any planar graph containing the configuration can be deduced from the four-colorability of planar graphs with fewer vertices. |
| 随便看 |
- efremov, dominik ivanovich
- efremov, filipp
- efremov, filipp sergeevich
- efremov, ivan
- efremov, ivan antonovich
- efremov, mikhail
- efremov, mikhail grigorevich
- efremov, mikhail timofeevich
- efremov, nikolai
- efremov, nikolai nikolaevich
- efremov, oleg
- efremov, oleg nikolaevich
- efremov-radyushkin-brodsky-lepage
- efremov, vasilii
- efremov, vasilii sergeevich
- efrem zimbalist
- efrem zimbalist, sr.
- efrep
- efrf
- efrg
- efrh
- efri
- efric
- efrj
- efrm
|