Interval edge-colorings of K_{1,m,n}
Combinatorics
2013-08-22 v1 Discrete Mathematics
Abstract
In this note we prove that K_{1,m,n} is interval edge-colorable if and only if gcd(m+1,n+1)=1. It settles in the affirmative a conjecture of Petrosyan.
Keywords
Cite
@article{arxiv.1308.4431,
title = {Interval edge-colorings of K_{1,m,n}},
author = {Andrzej Grzesik and Hrant Khachatrian},
journal= {arXiv preprint arXiv:1308.4431},
year = {2013}
}
Comments
6 pages, 2 figures. arXiv admin note: text overlap with arXiv:1303.1039 by other authors