{"paper":{"title":"Interval edge-colorings of composition of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hayk H. Tepanyan, Petros A. Petrosyan","submitted_at":"2015-08-01T19:00:40Z","abstract_excerpt":"An edge-coloring of a graph $G$ with consecutive integers $c_{1},\\ldots,c_{t}$ is called an \\emph{interval $t$-coloring} if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval colorable if it has an interval $t$-coloring for some positive integer $t$. The set of all interval colorable graphs is denoted by $\\mathfrak{N}$. In 2004, Giaro and Kubale showed that if $G,H\\in \\mathfrak{N}$, then the Cartesian product of these graphs belongs to $\\mathfrak{N}$. In the same year they formulated a similar proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00158","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}