Petros A. Petrosyan
Orcid: 0000-0001-7070-1417Affiliations:
- Department of Informatics and Applied Mathematics, Yerevan State University
According to our database1,
Petros A. Petrosyan
authored at least 42 papers
between 2007 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules.
Discret. Appl. Math., August, 2023
2021
2019
Discret. Math. Theor. Comput. Sci., 2019
2018
Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs.
Discret. Math., 2018
2017
Discret. Math., 2017
On Interval Edge-Colorings of Outerplanr Graphs.
Ars Comb., 2017
2016
Some parameters related to the deficiency of graphs and the deficiency of near-complete graphs.
CoRR, 2016
2015
2014
Discret. Appl. Math., 2014
CoRR, 2014
2013
Discuss. Math. Graph Theory, 2013
2012
Discret. Math., 2012
2011
Discuss. Math. Graph Theory, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Discret. Math., 2010
Interval Total Colorings of Bipartite Graphs.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2008
2007
Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori
CoRR, 2007