Geodesic
Description and generation of all minimal colorings of an interval graph, and the solution of related problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 36 (1996) no. 5, pp. 146-152 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1996_36_5_a15,
     author = {V. P. Kozyrev},
     title = {Description and generation of all minimal colorings of an interval graph, and the solution of related problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {146--152},
     year = {1996},
     volume = {36},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_5_a15/}
}
TY  - JOUR
AU  - V. P. Kozyrev
TI  - Description and generation of all minimal colorings of an interval graph, and the solution of related problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1996
SP  - 146
EP  - 152
VL  - 36
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_5_a15/
LA  - ru
ID  - ZVMMF_1996_36_5_a15
ER  - 
%0 Journal Article
%A V. P. Kozyrev
%T Description and generation of all minimal colorings of an interval graph, and the solution of related problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1996
%P 146-152
%V 36
%N 5
%U http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_5_a15/
%G ru
%F ZVMMF_1996_36_5_a15
V. P. Kozyrev. Description and generation of all minimal colorings of an interval graph, and the solution of related problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 36 (1996) no. 5, pp. 146-152. http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_5_a15/

[1] Teoriya i realizatsiya sistem realnogo vremeni, VTs AN SSSR, M., 1984

[2] Kharari F., Teoriya grafov, Mir, M., 1973 | MR

[3] Korte N., Mohring R. H., “An incremental linear-time algorithm for recognizing interval graphs”, SIAM J. Comput., 18:1 (1989), 68–81 | DOI | MR | Zbl

[4] Olarin S., “An optimal greedy heuristic to color interval graphs”, Inform. Process Letts., 31:1 (1991), 21–25 | DOI | MR

[5] Markosyan A. G., Markosyan S. E., “Algoritmy proverki nekotorykh svoistv grafov”, Kibernetika, 1976, no. 2, 76–82