Search

Issue
Title
Authors
Enumeration of labeled outerplanar bicyclic and tricyclic graphs
Voblyi V.A., Meleshko A.K.
Asymptotic approximation for the number of n-vertex graphs of given diameter
Fedoryaeva T.I.
The Second Riddell Relation and Its Consequences
Voblyi V.A.
The Functional Graph of a Linear Discrete Dynamical System with Two Dominating Vertices
Parfinenko A.S., Perezhogin A.L.
On 2-Connected Transmission Irregular Graphs
Dobrynin A.A.
Tree-Like Structure Graphs with Full Diversity of Balls
Evdokimov A.A., Fedoryaeva T.I.
1-Triangle graphs and perfect neighborhood sets
Irzhavskii P.A., Kartynnik Y.A., Orlovich Y.L.
Local primitivity of matrices and graphs
Fomichev V.M., Kyazhin S.N.
Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
Maksimenko A.N.
Relationship Between Homogeneous Bent Functions and Nagy Graphs
Shaporenko A.S.
König Graphs with Respect to the 4-Path and Its Spanning Supergraphs
Malyshev D.S., Mokeev D.B.
Perfect colorings of the infinite circulant graph with distances 1 and 2
Lisitsyna M.A., Parshina O.G.
Circulant discrete dynamical systems with threshold functions of at most three variables
Batueva T.C.
Independent sets in graphs without subtrees with many leaves
Alekseev V.E., Zakharova D.V.
On the Skeleton of the Polytope of Pyramidal Tours
Bondarenko V.A., Nikolaev A.V.
Lattice complete graphs
Bessonov Y.E., Dobrynin A.A.
On König graphs with respect to P4
Mokeev D.B.
Graph clustering with a constraint on cluster sizes
Il’ev V.P., Il’eva S.D., Navrotskaya A.A.
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
Malyshev D.S., Sirotkin D.V.
Enumeration of labeled connected graphs with given order and size
Voblyi V.A.
1 - 20 of 20 Items

Search tips:

  • Search terms are case-insensitive
  • Common words are ignored
  • By default only articles containing all terms in the query are returned (i.e., AND is implied)
  • Combine multiple words with OR to find articles containing either term; e.g., education OR research
  • Use parentheses to create more complex queries; e.g., archive ((journal OR conference) NOT theses)
  • Search for an exact phrase by putting it in quotes; e.g., "open access publishing"
  • Exclude a word by prefixing it with - or NOT; e.g. online -politics or online NOT politics
  • Use * in a term as a wildcard to match any sequence of characters; e.g., soci* morality would match documents containing "sociological" or "societal"

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies