default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmen S. Asratian
Person information
- affiliation: Linköping University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j30]Armen S. Asratian, Carl Johan Casselgren
, Petros A. Petrosyan:
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules. Discret. Appl. Math. 335: 25-35 (2023)- 2022
- [j29]Armen S. Asratian, Jonas B. Granholm:
On Hamiltonicity of regular graphs with bounded second neighborhoods. Discret. Appl. Math. 316: 75-86 (2022) - 2021
- [j28]Armen S. Asratian, Jonas B. Granholm, Nikolay Khachatryan:
Some local-global phenomena in locally finite graphs. Discret. Appl. Math. 293: 166-176 (2021) - [j27]Armen S. Asratian, Jonas B. Granholm, Nikolay Khachatryan:
A localization method in Hamiltonian graph theory. J. Comb. Theory B 148: 209-238 (2021)
2010 – 2019
- 2019
- [j26]Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan:
Cyclic deficiency of graphs. Discret. Appl. Math. 266: 171-185 (2019) - 2018
- [j25]Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan:
Some results on cyclic interval edge colorings of graphs. J. Graph Theory 87(2): 239-252 (2018) - 2016
- [j24]Armen S. Asratian, Carl Johan Casselgren:
Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results. J. Graph Theory 82(4): 350-373 (2016) - 2014
- [i1]Armen S. Asratian, Raffi R. Kamalian:
Interval colorings of edges of a multigraph. CoRR abs/1401.8079 (2014)
2000 – 2009
- 2009
- [j23]Armen S. Asratian:
A note on transformations of edge colorings of bipartite graphs. J. Comb. Theory B 99(5): 814-818 (2009) - [j22]Armen S. Asratian, Carl Johan Casselgren, Jennifer Vandenbussche, Douglas B. West:
Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs. J. Graph Theory 61(2): 88-97 (2009) - 2008
- [j21]Armen S. Asratian, Carl Johan Casselgren:
On Path Factors of (3, 4)-Biregular Bigraphs. Graphs Comb. 24(5): 405-411 (2008) - 2007
- [j20]Armen S. Asratian, Nikolay Khachatryan:
On local nature of some classical theorems on Hamilton cycles. Australas. J Comb. 38: 77-86 (2007) - [j19]Armen S. Asratian, Carl Johan Casselgren:
On interval edge colorings of (alpha, beta)-biregular bipartite graphs. Discret. Math. 307(15): 1951-1956 (2007) - 2006
- [j18]Armen S. Asratian:
New Local Conditions for a Graph to be Hamiltonian. Graphs Comb. 22(2): 153-160 (2006) - 2004
- [j17]Armen S. Asratian, Nikolai N. Kuzjurin:
Two sensitivity theorems in fuzzy integer programming. Discret. Appl. Math. 134(1-3): 129-140 (2004) - [c1]Armen S. Asratian:
A New Local Condition for a Graph to be Hamiltonian. CTW 2004: 47-49 - 2003
- [j16]Armen S. Asratian, Natalia Oksimets:
Pk+1-Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases. Electron. Notes Discret. Math. 13: 9-13 (2003) - 2002
- [j15]Armen S. Asratian, Dominique de Werra:
A generalized class-teacher model for some timetabling problems. Eur. J. Oper. Res. 143(3): 531-542 (2002) - 2001
- [j14]Armen S. Asratian, Nikolai N. Kuzjurin:
New class of 0-1 integer programs with tight approximation via linear relaxations. Math. Methods Oper. Res. 53(3): 363-370 (2001) - 2000
- [j13]Armen S. Asratian:
Some results on an edge coloring problem of Folkman and Fulkerson. Discret. Math. 223(1-3): 13-25 (2000)
1990 – 1999
- 1999
- [j12]Armen S. Asratian, Nikolai N. Kuzjurin:
On the number of nearly perfect matchings in almost regular uniform hypergraphs. Discret. Math. 207(1-3): 1-8 (1999) - 1998
- [j11]Armen S. Asratian, Natalia Oksimets:
Graphs with Hamiltonian balls. Australas. J Comb. 17: 185-198 (1998) - [j10]Armen S. Asratian:
Short Solution of Kotzig's Problem for Bipartite Graphs. J. Comb. Theory B 74(2): 160-168 (1998) - 1996
- [j9]Armen S. Asratian, G. V. Sarkisian:
Some panconnected and pancyclic properties of graphs with a local ore-type condition. Graphs Comb. 12(1): 209-219 (1996) - [j8]Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
On graphs satisfying a local ore-type condition. J. Graph Theory 21(1): 1-10 (1996) - [j7]Armen S. Asratian, Roland Häggkvist, G. V. Sarkisian:
A characterization of panconnected graphs satisfying a local ore-type condition. J. Graph Theory 22(2): 95-103 (1996) - [j6]Armen S. Asratian:
Every 3-connected, locally connected, claw-free graph is Hamilton-connected. J. Graph Theory 23(2): 191-201 (1996) - 1995
- [j5]Armen S. Asratian:
Some properties of graphs with local Ore condition. Ars Comb. 41 (1995) - 1994
- [j4]Armen S. Asratian:
A criterion for some Hamiltonian graphs to be Hamilton-connected. Australas. J Comb. 10: 193-198 (1994) - [j3]Armen S. Asratian, Raffi R. Kamalian:
Investigation on Interval Edge-Colorings of Graphs. J. Comb. Theory B 62(1): 34-43 (1994) - 1991
- [j2]Armen S. Asratian, N. K. Khachatrian:
Stable properties of graphs. Discret. Math. 90(2): 143-152 (1991) - 1990
- [j1]Armen S. Asratian, N. K. Khachatrian:
Some localization theorems on hamiltonian circuits. J. Comb. Theory B 49(2): 287-294 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
