RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2015, Volume 22, Number 2, Pages 63–72 (Mi da813)  

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.

DOI: https://doi.org/10.17377/daio.2015.22.454

Full text: PDF file (256 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2015, 9:2, 271–274

Bibliographic databases:

UDC: 519.174
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

Citation in format AMSBIB
\Bibitem{Pya15}
\by A.~V.~Pyatkin
\paper On interval $(1,1)$-coloring of incidentors of interval colorable graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 2
\pages 63--72
\mathnet{http://mi.mathnet.ru/da813}
\crossref{https://doi.org/10.17377/daio.2015.22.454}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3444478}
\elib{http://elibrary.ru/item.asp?id=23134007}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 2
\pages 271--274
\crossref{https://doi.org/10.1134/S199047891502012X}


Linking options:
  • http://mi.mathnet.ru/eng/da813
  • http://mi.mathnet.ru/eng/da/v22/i2/p63

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. S. Asratian, C. J. Casselgren, P. A. Petrosyan, “Some results on cyclic interval edge colorings of graphs”, J. Graph Theory, 87:2 (2018), 239–252  crossref  mathscinet  zmath  isi
  • Дискретный анализ и исследование операций
    Number of views:
    This page:190
    Full text:55
    References:41
    First page:16

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020