scientific article

From MaRDI portal
Publication:3996859

zbMath0711.05002MaRDI QIDQ3996859

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

Publication date: 17 September 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (60)

On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theoremConstruction of maximally non-Hamiltonian graphsTree-Like Structure Graphs with Full Diversity of BallsUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemAsymptotic approach to the problem of \(k\)-median of a graphDynamic network flows for generalized Kirchhoff lawOn Problem of Finding all Maximal Induced Bicliques of HypergraphOperads of hypergraphsUnnamed ItemFactor-powers of finite symmetric groupsPeriodic ground states for the Potts model with external field and a countable set of spin values on the Cayley treeUnnamed ItemMethods of finding dynamic flows in networks obeyed generalized Kirchhoff's lawSemigroups of strong endomorphisms of infinite graphs and hypergraphs.Elements of Fuzzy Logic in Solving Clustering ProblemsSteiner subratio of Riemannian manifoldsIssues of dynamic graph theoryThe Fermat-Steiner problem in the space of compact subsets of the Euclidean planeKinds of pregeometries of acyclic theoriesIndependent sets and chromatic numbers of circle graphsBifurcations of Steiner tree topologies in the planeAn algorithm for direct and inverse three-dimensional problems in vertical seismic profilingUnnamed ItemHierarchy of families of theories and their rank characteristicsA fragmented model for the problem of land use on hypergraphsA formula for the weight of a minimal filling of a finite metric spaceDirectional derivative of the weight of a minimal filling in Riemannian manifoldsTHE RANKS OF PLANARITY FOR VARIETIES OF COMMUTATIVE SEMIGROUPSCOMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPHConstruction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivityOn maximal graphical partitionsSynthesis-analysis of derivation sequences of tables' functional dependencesConstruction of simple path graphs in transport networks. I: General solutions and examplesPerfect matchings and \(K_{1,p}\)-restricted graphsTree decomposition and discrete optimization problems: a surveyThe high-tempeature relaxation function of a spin system with a quadratic contribution of fluctuations to the resonance frequencyUnnamed ItemOn connected list colorings of graphsUnary algebras without proper subalgebrasColoring of pseudocubic graphs in three colorsBuchstaber invariant theory of simplicial complexes and convex polytopesAlgebraization of inferring functional dependences in relational databasesThe operad of finite labeled tournamentsA new approach to operating with undirected treesОб одной задаче распознавания предфрактального графаModeling of optimal networks by means of linkagesBifurcations of binary types of Steiner minimal networks in the planeBifurcations of minimal fillings for four points on the Euclidean planeOn maximal graphical partitions that are the nearest to a given graphical partitionRecognition of fractal graphsOn optimal exact coverings of a graph in the class of weakly dense basesUnnamed ItemUnnamed ItemMethod of elimination of a group of unknown flows in networks with the generalized Kirchhoff lawStabilization of locally minimal treesThe Fermat-Steiner problem in the space of compact subsets of endowed with the Hausdorff metric1-Triangle graphs and perfect neighborhood sets






This page was built for publication: