Publication:3996859

O. I. Mel'Nikov, Vladimir I. Sarvanov, Regina I. Tyshkevich, Vladimir A. Emelichev

Publication date: 17 September 1992

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items

On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem, Construction of maximally non-Hamiltonian graphs, Tree-Like Structure Graphs with Full Diversity of Balls, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Asymptotic approach to the problem of \(k\)-median of a graph, Dynamic network flows for generalized Kirchhoff law, On Problem of Finding all Maximal Induced Bicliques of Hypergraph, Operads of hypergraphs, Unnamed Item, Factor-powers of finite symmetric groups, Periodic ground states for the Potts model with external field and a countable set of spin values on the Cayley tree, Unnamed Item, Methods of finding dynamic flows in networks obeyed generalized Kirchhoff's law, Semigroups of strong endomorphisms of infinite graphs and hypergraphs., Elements of Fuzzy Logic in Solving Clustering Problems, Steiner subratio of Riemannian manifolds, Issues of dynamic graph theory, The Fermat-Steiner problem in the space of compact subsets of the Euclidean plane, Kinds of pregeometries of acyclic theories, Independent sets and chromatic numbers of circle graphs, Bifurcations of Steiner tree topologies in the plane, An algorithm for direct and inverse three-dimensional problems in vertical seismic profiling, Unnamed Item, Hierarchy of families of theories and their rank characteristics, A fragmented model for the problem of land use on hypergraphs, A formula for the weight of a minimal filling of a finite metric space, Directional derivative of the weight of a minimal filling in Riemannian manifolds, THE RANKS OF PLANARITY FOR VARIETIES OF COMMUTATIVE SEMIGROUPS, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity, On maximal graphical partitions, Synthesis-analysis of derivation sequences of tables' functional dependences, Construction of simple path graphs in transport networks. I: General solutions and examples, Perfect matchings and \(K_{1,p}\)-restricted graphs, Tree decomposition and discrete optimization problems: a survey, The high-tempeature relaxation function of a spin system with a quadratic contribution of fluctuations to the resonance frequency, Unnamed Item, On connected list colorings of graphs, Unary algebras without proper subalgebras, Coloring of pseudocubic graphs in three colors, Buchstaber invariant theory of simplicial complexes and convex polytopes, Algebraization of inferring functional dependences in relational databases, The operad of finite labeled tournaments, A new approach to operating with undirected trees, Об одной задаче распознавания предфрактального графа, Modeling of optimal networks by means of linkages, Bifurcations of binary types of Steiner minimal networks in the plane, Bifurcations of minimal fillings for four points on the Euclidean plane, On maximal graphical partitions that are the nearest to a given graphical partition, Recognition of fractal graphs, On optimal exact coverings of a graph in the class of weakly dense bases, Unnamed Item, Unnamed Item, Method of elimination of a group of unknown flows in networks with the generalized Kirchhoff law, Stabilization of locally minimal trees, The Fermat-Steiner problem in the space of compact subsets of endowed with the Hausdorff metric, 1-Triangle graphs and perfect neighborhood sets