Publication:3996859
From MaRDI portal
zbMath0711.05002MaRDI QIDQ3996859
O. I. Mel'Nikov, Vladimir I. Sarvanov, Regina I. Tyshkevich, Vladimir A. Emelichev
Publication date: 17 September 1992
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
Related Items
Tree-Like Structure Graphs with Full Diversity of Balls, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Construction of maximally non-Hamiltonian graphs, Unnamed Item, Unnamed Item, Unnamed Item, On Problem of Finding all Maximal Induced Bicliques of Hypergraph, Unnamed Item, THE RANKS OF PLANARITY FOR VARIETIES OF COMMUTATIVE SEMIGROUPS, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, Об одной задаче распознавания предфрактального графа, 1-Triangle graphs and perfect neighborhood sets, Unnamed Item, A formula for the weight of a minimal filling of a finite metric space, The high-tempeature relaxation function of a spin system with a quadratic contribution of fluctuations to the resonance frequency, On connected list colorings of graphs, The Fermat-Steiner problem in the space of compact subsets of endowed with the Hausdorff metric, Unnamed Item, Elements of Fuzzy Logic in Solving Clustering Problems, The Fermat-Steiner problem in the space of compact subsets of the Euclidean plane, On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem, Operads of hypergraphs, Methods of finding dynamic flows in networks obeyed generalized Kirchhoff's law, Semigroups of strong endomorphisms of infinite graphs and hypergraphs., Directional derivative of the weight of a minimal filling in Riemannian manifolds, On maximal graphical partitions, The operad of finite labeled tournaments, Issues of dynamic graph theory, Independent sets and chromatic numbers of circle graphs, Stabilization of locally minimal trees, Dynamic network flows for generalized Kirchhoff law, Recognition of fractal graphs, Method of elimination of a group of unknown flows in networks with the generalized Kirchhoff law, Asymptotic approach to the problem of \(k\)-median of a graph, Factor-powers of finite symmetric groups, 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, Unary algebras without proper subalgebras, 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, Periodic ground states for the Potts model with external field and a countable set of spin values on the Cayley tree, Bifurcations of Steiner tree topologies in the plane, Hierarchy of families of theories and their rank characteristics, A fragmented model for the problem of land use on hypergraphs, Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity, Coloring of pseudocubic graphs in three colors, Algebraization of inferring functional dependences in relational databases, On maximal graphical partitions that are the nearest to a given graphical partition, An algorithm for direct and inverse three-dimensional problems in vertical seismic profiling, Tree decomposition and discrete optimization problems: a survey, Buchstaber invariant theory of simplicial complexes and convex polytopes, On optimal exact coverings of a graph in the class of weakly dense bases
