Armen S. Asratian

Affiliations:
  • Linköping University, Sweden


According to our database1, Armen S. Asratian authored at least 32 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules.
Discret. Appl. Math., August, 2023

2022
On Hamiltonicity of regular graphs with bounded second neighborhoods.
Discret. Appl. Math., 2022

2021
A localization method in Hamiltonian graph theory.
J. Comb. Theory, Ser. B, 2021

Some local-global phenomena in locally finite graphs.
Discret. Appl. Math., 2021

2019
Cyclic deficiency of graphs.
Discret. Appl. Math., 2019

2018
Some results on cyclic interval edge colorings of graphs.
J. Graph Theory, 2018

2016
Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results.
J. Graph Theory, 2016

2014
Interval colorings of edges of a multigraph.
CoRR, 2014

2009
Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs.
J. Graph Theory, 2009

A note on transformations of edge colorings of bipartite graphs.
J. Comb. Theory, Ser. B, 2009

2008
On Path Factors of (3, 4)-Biregular Bigraphs.
Graphs Comb., 2008

2007
On interval edge colorings of (alpha, beta)-biregular bipartite graphs.
Discret. Math., 2007

On local nature of some classical theorems on Hamilton cycles.
Australas. J Comb., 2007

2006
New Local Conditions for a Graph to be Hamiltonian.
Graphs Comb., 2006

2004
Two sensitivity theorems in fuzzy integer programming.
Discret. Appl. Math., 2004

A New Local Condition for a Graph to be Hamiltonian.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
P<sub>k+1</sub>-Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases.
Electron. Notes Discret. Math., 2003

2002
A generalized class-teacher model for some timetabling problems.
Eur. J. Oper. Res., 2002

2001
New class of 0-1 integer programs with tight approximation via linear relaxations.
Math. Methods Oper. Res., 2001

2000
Some results on an edge coloring problem of Folkman and Fulkerson.
Discret. Math., 2000

1999
On the number of nearly perfect matchings in almost regular uniform hypergraphs.
Discret. Math., 1999

1998
Short Solution of Kotzig's Problem for Bipartite Graphs.
J. Comb. Theory, Ser. B, 1998

Graphs with Hamiltonian balls.
Australas. J Comb., 1998

1996
A characterization of panconnected graphs satisfying a local ore-type condition.
J. Graph Theory, 1996

On graphs satisfying a local ore-type condition.
J. Graph Theory, 1996

Every 3-connected, locally connected, claw-free graph is Hamilton-connected.
J. Graph Theory, 1996

Some panconnected and pancyclic properties of graphs with a local ore-type condition.
Graphs Comb., 1996

1995
Some properties of graphs with local Ore condition.
Ars Comb., 1995

1994
Investigation on Interval Edge-Colorings of Graphs.
J. Comb. Theory, Ser. B, 1994

A criterion for some Hamiltonian graphs to be Hamilton-connected.
Australas. J Comb., 1994

1991
Stable properties of graphs.
Discret. Math., 1991

1990
Some localization theorems on hamiltonian circuits.
J. Comb. Theory, Ser. B, 1990


  Loading...