Geodesic
On interval $(1,1)$-coloring of incidentors of interval colorable graphs
Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 2, pp. 63-72

Voir la notice de l'article provenant de la source Math-Net.Ru

A graph is interval colorable if it has a proper edge coloring such that for every vertex the colors used for coloring edges adjacent to it form an interval. A subdivision of a graph is a graph obtained by substituting a path of length two for each edge. P. Petrosyan and H. Khachatrian posed a conjecture that the subdivision of each interval colorable graph is interval colorable. In this paper, we prove this conjecture. Bibliogr. 19.
Keywords: interval coloring, incidentor, graph subdivision. 
@article{DA_2015_22_2_a4,
     author = {A. V. Pyatkin},
     title = {On interval $(1,1)$-coloring of incidentors of interval colorable graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {63--72},
     publisher = {mathdoc},
     volume = {22},
     number = {2},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2015_22_2_a4/}
}
TY  - JOUR
AU  - A. V. Pyatkin
TI  - On interval $(1,1)$-coloring of incidentors of interval colorable graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2015
SP  - 63
EP  - 72
VL  - 22
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2015_22_2_a4/
LA  - ru
ID  - DA_2015_22_2_a4
ER  - 
%0 Journal Article
%A A. V. Pyatkin
%T On interval $(1,1)$-coloring of incidentors of interval colorable graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2015
%P 63-72
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2015_22_2_a4/
%G ru
%F DA_2015_22_2_a4
A. V. Pyatkin. On interval $(1,1)$-coloring of incidentors of interval colorable graphs. Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 2, pp. 63-72. http://geodesic.mathdoc.fr/item/DA_2015_22_2_a4/