![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Petros A. Petrosyan
Person information
- affiliation: Department of Informatics and Applied Mathematics, Yerevan State University
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]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) - 2021
- [j20]Carl Johan Casselgren
, Petros A. Petrosyan:
Improper interval edge colorings of graphs. Discret. Appl. Math. 305: 164-178 (2021)
2010 – 2019
- 2019
- [j19]Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
:
Cyclic deficiency of graphs. Discret. Appl. Math. 266: 171-185 (2019) - [j18]Carl Johan Casselgren, Petros A. Petrosyan:
Some results on the palette index of graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [i28]Armen R. Davtyan, Gevorg M. Minasyan, Petros A. Petrosyan:
On the deficiency of complete multipartite graphs. CoRR abs/1912.01546 (2019) - 2018
- [j17]Carl Johan Casselgren, Hrant Khachatrian, Petros A. Petrosyan
:
Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs. Discret. Math. 341(3): 627-637 (2018) - [j16]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) - 2017
- [j15]Petros A. Petrosyan:
On Interval Edge-Colorings of Outerplanr Graphs. Ars Comb. 132: 127-135 (2017) - [j14]Hayk H. Tepanyan, Petros A. Petrosyan
:
Interval edge-colorings of composition of graphs. Discret. Appl. Math. 217: 368-374 (2017) - [j13]Petros A. Petrosyan
, Hrant Khachatrian:
Further results on the deficiency of graphs. Discret. Appl. Math. 226: 117-126 (2017) - [j12]Carl Johan Casselgren, Petros A. Petrosyan
, Bjarne Toft:
On interval and cyclic interval edge colorings of (3, 5)-biregular graphs. Discret. Math. 340(11): 2678-2687 (2017) - 2016
- [j11]Petros A. Petrosyan
, Sargis T. Mkhitaryan:
Interval cyclic edge-colorings of graphs. Discret. Math. 339(7): 1848-1860 (2016) - [j10]Hrant Khachatrian, Petros A. Petrosyan
:
Interval edge-colorings of complete graphs. Discret. Math. 339(9): 2249-2262 (2016) - [i27]Petros A. Petrosyan, Hrant Khachatrian:
Some parameters related to the deficiency of graphs and the deficiency of near-complete graphs. CoRR abs/1608.00904 (2016) - 2015
- [i26]Petros A. Petrosyan, Hayk H. Tepanyan:
Interval edge-colorings of composition of graphs. CoRR abs/1508.00158 (2015) - [i25]Petros A. Petrosyan, Vahan V. Mkrtchyan, Rafayel R. Kamalian:
Graph Theory. CoRR abs/1510.00945 (2015) - 2014
- [j9]Petros A. Petrosyan
, Rafael R. Kamalian
:
On sum edge-coloring of regular, bipartite and split graphs. Discret. Appl. Math. 165: 263-269 (2014) - [j8]Petros A. Petrosyan
:
On maximum matchings in almost regular graphs. Discret. Math. 318: 58-61 (2014) - [j7]Petros A. Petrosyan
, Hrant Khachatrian
:
Interval Non-edge-Colorable Bipartite Graphs and Multigraphs. J. Graph Theory 76(3): 200-216 (2014) - [i24]Petros A. Petrosyan:
Sequential edge-coloring on the subset of vertices of almost regular graphs. CoRR abs/1401.0836 (2014) - [i23]Petros A. Petrosyan, Nerses A. Khachatryan:
Interval Total Colorings of Complete Multipartite Graphs and Hypercubes. CoRR abs/1408.2317 (2014) - [i22]Petros A. Petrosyan, Sargis T. Mkhitaryan:
Interval cyclic edge-colorings of graphs. CoRR abs/1411.0290 (2014) - [i21]Hrant Khachatrian, Petros A. Petrosyan:
Interval edge-colorings of complete graphs. CoRR abs/1411.5661 (2014) - 2013
- [j6]Hrant Khachatrian
, Petros A. Petrosyan
, Hovhannes Tananyan:
Interval edge-colorings of Cartesian products of graphs I. Discuss. Math. Graph Theory 33(3): 613-632 (2013) - [i20]Petros A. Petrosyan, Hrant Khachatrian:
Interval non-edge-colorable bipartite graphs and multigraphs. CoRR abs/1301.3811 (2013) - [i19]Petros A. Petrosyan:
On interval edge-colorings of outerplanar graphs. CoRR abs/1303.1039 (2013) - [i18]Petros A. Petrosyan:
On Interval Non-Edge-Colorable Eulerian Multigraphs. CoRR abs/1311.2210 (2013) - 2012
- [j5]Rafael R. Kamalian, Petros A. Petrosyan
:
A note on upper bounds for the maximum span in interval edge-colorings of graphs. Discret. Math. 312(8): 1393-1399 (2012) - [i17]Petros A. Petrosyan, Hrant Khachatrian, Hovhannes Tananyan:
Interval edge-colorings of Cartesian products of graphs I. CoRR abs/1202.0023 (2012) - [i16]Petros A. Petrosyan:
On maximum matchings in almost regular graphs. CoRR abs/1202.0681 (2012) - [i15]Petros A. Petrosyan, Rafael R. Kamalian:
On sum edge-coloring of regular, bipartite and split graphs. CoRR abs/1211.5307 (2012) - [i14]Petros A. Petrosyan:
Interval colorings of complete balanced multipartite graphs. CoRR abs/1211.5311 (2012) - 2011
- [j4]Petros A. Petrosyan
, H. E. Sargsyan:
On resistance of graphs. Discret. Appl. Math. 159(16): 1889-1900 (2011) - [j3]Petros A. Petrosyan
:
Interval edge colorings of some products of graphs. Discuss. Math. Graph Theory 31(2): 357-373 (2011) - [c3]Petros A. Petrosyan, Rafael R. Kamalian:
Edge-chromatic sums of regular and bipartite graphs. CTW 2011: 227-230 - [i13]Vahan V. Mkrtchyan, Petros A. Petrosyan:
A note on triangle-free graphs. CoRR abs/1101.3188 (2011) - [i12]Petros A. Petrosyan:
Interval edge-colorings of cubic graphs. CoRR abs/1110.1161 (2011) - [i11]Petros A. Petrosyan, Hrant Khachatrian, Liana Yepremyan, Hovhannes Tananyan:
Interval edge-colorings of graph products. CoRR abs/1110.1165 (2011) - 2010
- [j2]Petros A. Petrosyan
, H. Z. Arakelyan, V. M. Baghdasaryan:
A generalization of interval edge-colorings of graphs. Discret. Appl. Math. 158(16): 1827-1837 (2010) - [j1]Petros A. Petrosyan
:
Interval edge-colorings of complete graphs and n-dimensional cubes. Discret. Math. 310(10-11): 1580-1587 (2010) - [c2]Petros A. Petrosyan, Ani Shashikyan, Arman Yu. Torosyan:
Interval Total Colorings of Bipartite Graphs. CTW 2010: 133-136 - [i10]Rafael R. Kamalian, Petros A. Petrosyan:
A note on interval edge-colorings of graphs. CoRR abs/1007.1717 (2010) - [i9]Petros A. Petrosyan, Arman Yu. Torosyan, N. A. Khachatryan:
Interval total colorings of graphs. CoRR abs/1010.2989 (2010)
2000 – 2009
- 2009
- [c1]Petros A. Petrosyan, H. E. Sargsyan:
On Resistance of Graphs. CTW 2009: 64-67 - [i8]Petros A. Petrosyan:
Interval edge colorings of some products of graphs. CoRR abs/0911.4459 (2009) - [i7]Rafael R. Kamalian, Petros A. Petrosyan:
A note on upper bounds for the maximum span in interval edge colorings of graphs. CoRR abs/0911.5258 (2009) - 2008
- [i6]Petros A. Petrosyan:
Interval Edge Colorings of Mobius Ladders. CoRR abs/0801.0159 (2008) - 2007
- [i5]Rafael R. Kamalian, Petros A. Petrosyan:
On Lower Bound for W(K2n). CoRR abs/0712.2567 (2007) - [i4]Petros A. Petrosyan:
Interval Edge Colourings of Complete Graphs and n-cubes. CoRR abs/0712.2585 (2007) - [i3]Rafael R. Kamalian, Petros A. Petrosyan:
Interval Colourings of Some Regular Graphs. CoRR abs/0712.3150 (2007) - [i2]Rafael R. Kamalian, Petros A. Petrosyan:
On Interval Colorings of Complete k-partite Graphs K_{n}^{k}. CoRR abs/0712.3155 (2007) - [i1]Petros A. Petrosyan, Gagik H. Karapetyan:
Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori. CoRR abs/0712.4148 (2007)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint