Interval edge-colorings of Cartesian products of graphs I

Khachatrian, Hrant; A. Petrosyan, Petros; G. Tananyan, Hovhannes

doi:10.7151/dmgt.1693

Public

Interval edge-colorings of Cartesian products of graphs I

Published in Discussiones Mathematicae Graph Theory • Jan 1, 2013

Authors:

Hrant Khachatrian

Petros A. Petrosyan

Hovhannes G. Tananyan

Abstract

A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used and the colors of edges incident to each vertex of G form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. Let N be the ...

Subject

Combinatorics

Edge coloring

Mathematics

Research Assistant

AI chat, annotations, notes & similar papers

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!