Interval edge-colorings of Cartesian products of graphs II
Petros A. Petrosyan, Hrant H. Khachatrian, Hovhannes G. Tananyan

TL;DR
This paper investigates bounds on the maximum number of colors in interval edge-colorings of Cartesian product graphs, providing new sharp bounds and applications to specific graph families like tori, Hamming graphs, and Fibonacci cubes.
Contribution
It introduces new sharp bounds on $W(G imes H)$ for interval colorable graphs, improving understanding of coloring properties for complex graph products.
Findings
Established lower bounds for $W(G imes H)$ when $H$ is regular.
Derived upper bounds for $W(G)$ under distance conditions.
Unified bounds for hypercubes, tori, and Hamming graphs.
Abstract
An \emph{interval -coloring} of a graph is a proper edge-coloring with colors such that the colors on the edges incident to every vertex of are colored by consecutive colors. A graph is called \emph{interval colorable} if it has an interval -coloring for some positive integer . Let be the set of all interval colorable graphs. For a graph , we denote by and the minimum and maximum number of colors in an interval coloring of a graph , respectively. In this paper we present some new sharp bounds on for graphs and satisfying various conditions. In particular, we show that if and is an -regular graph, then . We also derive a new upper bound on for interval colorable connected graphs with additional distance conditions.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · graph theory and CDMA systems
