|
This article is cited in 1 scientific paper (total in 1 paper)
On interval $(1,1)$-coloring of incidentors of interval colorable graphs
A. V. Pyatkinab a Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
Abstract:
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.
Received: 02.06.2014 Revised: 24.11.2014
Citation:
A. V. Pyatkin, “On interval $(1,1)$-coloring of incidentors of interval colorable graphs”, Diskretn. Anal. Issled. Oper., 22:2 (2015), 63–72; J. Appl. Industr. Math., 9:2 (2015), 271–274
Linking options:
https://www.mathnet.ru/eng/da813 https://www.mathnet.ru/eng/da/v22/i2/p63
|
Statistics & downloads: |
Abstract page: | 287 | Full-text PDF : | 97 | References: | 63 | First page: | 16 |
|