Petros Petrosyan - Publications - Bridge of Knowledge

Petros Petrosyan

Employment

No data

Keywords Help

edge coloring interval edge coloring interval coloring near-interval coloring

Publications

results on page:
year:
- selected sort by year newest first
- sort by year oldest first
title:
- selected sort by title A-Z
- sort by title Z-A
citation:
- sort by citation descending
- sort by citation ascending

Filters

total: 1

Year 2025

Near-interval edge colorings of graphs
Publication
- C. J. Casselgren
- M. Małafiejski
- K. Pastuszak
- P. Petrosyan
- DISCRETE APPLIED MATHEMATICS - Year 2025
An interval edge coloring of a graph is a proper edge coloring by integers such that the colors on the edges incident with any vertex form an interval of integers. Not all graphs are interval colorable; a simple counterexample is K3. A near-interval coloring is a proper edge coloring of a graph such that the colors on the edges incident with any vertex is either an interval or a near-interval, where the latter is an interval except...

Full text to download in external service

seen 0 times