Some localization theorems on hamiltonian circuits. - Armen S. Asratian; N. K. Khachatrian (J. Comb. Theory B, 1990)

Stable properties of graphs. - Armen S. Asratian; N. K. Khachatrian (Discret. Math., 1991)

A criterion for some Hamiltonian graphs to be Hamilton-connected. - Armen S. Asratian (Australas. J Comb., 1994)

Investigation on Interval Edge-Colorings of Graphs. - Armen S. Asratian; Raffi R. Kamalian (J. Comb. Theory B, 1994)

Some properties of graphs with local Ore condition. - Armen S. Asratian (Ars Comb., 1995)

Some panconnected and pancyclic properties of graphs with a local ore-type condition. - Armen S. Asratian; G. V. Sarkisian (Graphs Comb., 1996)

Every 3-connected, locally connected, claw-free graph is Hamilton-connected. - Armen S. Asratian (J. Graph Theory, 1996)

On graphs satisfying a local ore-type condition. - Armen S. Asratian; Haitze J. Broersma; Jan van den Heuvel; Henk Jan Veldman (J. Graph Theory, 1996)

A characterization of panconnected graphs satisfying a local ore-type condition. - Armen S. Asratian; Roland Häggkvist; G. V. Sarkisian (J. Graph Theory, 1996)

Graphs with Hamiltonian balls. - Armen S. Asratian; Natalia Oksimets (Australas. J Comb., 1998)

Short Solution of Kotzig's Problem for Bipartite Graphs. - Armen S. Asratian (J. Comb. Theory B, 1998)

On the number of nearly perfect matchings in almost regular uniform hypergraphs. - Armen S. Asratian; Nikolai N. Kuzjurin (Discret. Math., 1999)

Some results on an edge coloring problem of Folkman and Fulkerson. - Armen S. Asratian (Discret. Math., 2000)

New class of 0-1 integer programs with tight approximation via linear relaxations. - Armen S. Asratian; Nikolai N. Kuzjurin (Math. Methods Oper. Res., 2001)

A generalized class-teacher model for some timetabling problems. - Armen S. Asratian; Dominique de Werra (Eur. J. Oper. Res., 2002)

Pk+1-Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases. - Armen S. Asratian; Natalia Oksimets (Electron. Notes Discret. Math., 2003)

A New Local Condition for a Graph to be Hamiltonian. - Armen S. Asratian (CTW, 2004)

Two sensitivity theorems in fuzzy integer programming. - Armen S. Asratian; Nikolai N. Kuzjurin (Discret. Appl. Math., 2004)

New Local Conditions for a Graph to be Hamiltonian. - Armen S. Asratian (Graphs Comb., 2006)

On local nature of some classical theorems on Hamilton cycles. - Armen S. Asratian; Nikolay Khachatryan (Australas. J Comb., 2007)

On interval edge colorings of (alpha, beta)-biregular bipartite graphs. - Armen S. Asratian; Carl Johan Casselgren (Discret. Math., 2007)

On Path Factors of (3, 4)-Biregular Bigraphs. - Armen S. Asratian; Carl Johan Casselgren (Graphs Comb., 2008)

A note on transformations of edge colorings of bipartite graphs. - Armen S. Asratian (J. Comb. Theory B, 2009)

Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs. - Armen S. Asratian; Carl Johan Casselgren; Jennifer Vandenbussche; Douglas B. West (J. Graph Theory, 2009)

Interval colorings of edges of a multigraph. - Armen S. Asratian; Raffi R. Kamalian (CoRR, 2014)

Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results. - Armen S. Asratian; Carl Johan Casselgren (J. Graph Theory, 2016)

Some results on cyclic interval edge colorings of graphs. - Armen S. Asratian; Carl Johan Casselgren; Petros A. Petrosyan (J. Graph Theory, 2018)

Cyclic deficiency of graphs. - Armen S. Asratian; Carl Johan Casselgren; Petros A. Petrosyan (Discret. Appl. Math., 2019)

Some local-global phenomena in locally finite graphs. - Armen S. Asratian; Jonas B. Granholm; Nikolay Khachatryan (Discret. Appl. Math., 2021)

A localization method in Hamiltonian graph theory. - Armen S. Asratian; Jonas B. Granholm; Nikolay Khachatryan (J. Comb. Theory B, 2021)

On Hamiltonicity of regular graphs with bounded second neighborhoods. - Armen S. Asratian; Jonas B. Granholm (Discret. Appl. Math., 2022)

Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules. - Armen S. Asratian; Carl Johan Casselgren; Petros A. Petrosyan (Discret. Appl. Math., 2023)