M. B. Abrosimov

From MaRDI portal
Person:650324


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimal graphs with prescribed connectivities
Mathematical Notes
2023-04-19Paper
About uniqueness of the minimal 1-edge extension of hypercube Q4
Prikladnaya Diskretnaya Matematika
2023-01-19Paper
Vertex extensions of 4-layer graphs and hypercubes
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
2023-01-17Paper
The minimal vertex extensions for colored complete graphs
Bulletin of the South Ural State University series "Mathematics. Mechanics. Physics"
2022-04-01Paper
The maximum number of vertices of primitive regular graphs of orders 2, 3, 4 with exponent 2
Prikladnaya Diskretnaya Matematika
2021-08-17Paper
Generation of colored graphs with isomorphism rejection
Izvestia of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
2021-06-23Paper
The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives
Izvestia of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
2021-06-23Paper
Comparison of sufficient degree based conditions for Hamiltonian graph
Prikladnaya Diskretnaya Matematika
2021-02-17Paper
Constructing all nonisomorphic supergraphs with isomorphism rejection
Prikladnaya Diskretnaya Matematika
2021-02-17Paper
ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION
Prikladnaya diskretnaya matematika
2021-02-16Paper
On the uniqueness of exact vertex extensions
 
2021-02-15Paper
On properties of minimal extensions of orgraphs
 
2021-02-15Paper
scientific article; zbMATH DE number 7310069 (Why is no real title available?)
 
2021-02-15Paper
scientific article; zbMATH DE number 7310088 (Why is no real title available?)
 
2021-02-15Paper
Reliability analysis of graphical CAPTCHA-systems by the example of KCAPTCHA
 
2021-02-15Paper
scientific article; zbMATH DE number 7310134 (Why is no real title available?)
 
2021-02-15Paper
scientific article; zbMATH DE number 7310136 (Why is no real title available?)
 
2021-02-15Paper
Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension
 
2021-02-15Paper
scientific article; zbMATH DE number 7310216 (Why is no real title available?)
 
2021-02-15Paper
scientific article; zbMATH DE number 7301718 (Why is no real title available?)
 
2021-01-26Paper
scientific article; zbMATH DE number 7301786 (Why is no real title available?)
 
2021-01-26Paper
scientific article; zbMATH DE number 7301787 (Why is no real title available?)
 
2021-01-26Paper
scientific article; zbMATH DE number 7300406 (Why is no real title available?)
 
2021-01-25Paper
Construction of all minimal edge extensions of the graph with isomorphism rejection
Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
2020-09-23Paper
Number estimation for additional arcs in a minimal 1-vertex extension of tournament
Prikladnaya diskretnaya matematika. Prilozhenie
2020-08-20Paper
Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
2020-03-02Paper
On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
2019-03-01Paper
Characterization of graphs with a small number of additional arcs in a minimal 1-vertex extension
 
2015-02-12Paper
On the number of additional edges of a minimal vertex 1-extension of a starlike tree
Izvestiya Saratovskogo Universiteta. Novaya Seriya. Seriya Matematika, Mekhanika, Informatika
2014-11-11Paper
On the complexity of some problems related to graph extensions
Mathematical Notes
2011-11-25Paper
Minimal \(k\)-extensions of precomplete graphs
Russian Mathematics
2005-08-26Paper


Research outcomes over time


This page was built for person: M. B. Abrosimov