1.5k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR119 papers
- A. Alikhanyan National LaboratoryAM118 papers
- Universität InnsbruckAT103 papers
- Humboldt-Universität zu BerlinDE97 papers
- Ruhr University BochumDE97 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR94 papers
- Heidelberg UniversityDE93 papers
- Dublin Institute For Advanced StudiesIE92 papers
- École PolytechniqueFR92 papers
- Laboratoire d’Annecy de Physique des ParticulesFR92 papers
- North-West UniversityZA92 papers
- Jagiellonian UniversityPL91 papers
4 papers · 2 filters
A note on upper bounds for the maximum span in interval edge colorings of graphs
R. R. Kamalian, P. A. Petrosyan
An edge coloring of a graph with colors is called an interval -coloring if for each there is at least one edge of colored by , the c…
Interval edge colorings of some products of graphs
Petros A. Petrosyan
An edge coloring of a graph with colors is called an interval -coloring if for each there is at least one edge of colored by ,…
On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs
Davit Aslanyan, Vahan V. Mkrtchyan, Samvel S. Petrosyan +1
We show that any factor of a cubic graph can be extended to a maximum edge-colorable subgraph. We also show that the sum of sizes of maximum and edge-colorable sub…
On upper bounds for parameters related to construction of special maximum matchings
Artur Khojabaghyan, Vahan V. Mkrtchyan
For a graph let and denote the size of the largest and smallest maximum matching of a graph obtained from by removing a maximum matching of . We show that…