57 citations · 63 across the 10 of their papers we have counts for
12 papers
The edge chromatic transformation index of graphs
Armen S. Asratian, Carl Johan Casselgren
Given a graph or multigraph , let denote the minimum integer such that any proper --edge coloring of can be transformed into any other proper $χ'(…
A note on transformations of edge colorings of chordless graphs and triangle-free graphs
Armen Asratian
Bonamy et al. (2023) proved that an optimal edge coloring of a simple triangle--free graph can be reached from any given proper edge coloring of through a series of Kempe c…
On Hamiltonicity of regular graphs with bounded second neighborhoods
Armen S. Asratian, Jonas B. Granholm
Let denote the set of connected -regular graphs , , where the number of vertices at distance 2 from any vertex in does not exceed . Asratian (…
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
A graph is called interval colorable if it has a proper edge coloring with colors such that the colors of the edges incident to every vertex of form an interv…
A localization method in Hamiltonian graph theory
Armen S. Asratian, Jonas B. Granholm, Nikolay K. Khachatryan
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large edge density and small diameter. In a series of papers Asratian and Khachatryan d…
Some local--global phenomena in locally finite graphs
Armen S. Asratian, Jonas B. Granholm, Nikolay K. Khachatryan
In this paper we present some results for a connected infinite graph with finite degrees where the properties of balls of small radii guarantee the existence of some Hamiltonia…