|
|
Publications in Math-Net.Ru |
Citations |
|
2008 |
1. |
V. A. Tashkinov, “On planar graphs without list $3$-coloring”, Sib. Èlektron. Mat. Izv., 5 (2008), 685–690 |
|
2004 |
2. |
O. V. Borodin, A. N. Glebov, A. O. Ivanova, T. K. Neustroeva, V. A. Tashkinov, “Sufficient conditions for planar graphs to be $2$-distance $(\Delta+1)$-colorable”, Sib. Èlektron. Mat. Izv., 1 (2004), 129–141 |
34
|
3. |
V. A. Tashkinov, “A lower bound for the chromatic number of graphs with a given maximal degree and girth”, Sib. Èlektron. Mat. Izv., 1 (2004), 99–109 |
3
|
|
2001 |
4. |
V. A. Tashkinov, “On the isometric embedding of arbitrary graphs into a graph of a given diameter possessing the metric continuation property”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001), 73–80 |
|
2000 |
5. |
V. A. Tashkinov, “On an algorithm for the edge coloring of multigraphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000), 72–85 |
14
|
|
1988 |
6. |
V. A. Tashkinov, “Regular subpseudographs of regular pseudographs”, Mat. Zametki, 43:2 (1988), 263–275 ; Math. Notes, 43:2 (1988), 149–156 |
|
1984 |
7. |
V. A. Tashkinov, “Three-regular parts of four-regular graphs”, Mat. Zametki, 36:2 (1984), 239–259 ; Math. Notes, 36:2 (1984), 612–623 |
3
|
|
1982 |
8. |
V. A. Tashkinov, “Regular subgraphs of regular graphs”, Dokl. Akad. Nauk SSSR, 265:1 (1982), 43–44 |
|
Organisations |
|
|
|
|