scientific article
From MaRDI portal
Publication:3127081
zbMath0865.05001MaRDI QIDQ3127081
O. I. Mel'Nikov, Vladimir I. Sarvanov, Regina I. Tyshkevich, Vladimir A. Emelichev
Publication date: 6 April 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pathsalgorithmsindependencetextbookcyclestransversalsconnectivityhypergraphsdigraphsmatroidsplanaritytreesmatchingscoveringscoloringsdegree sequencestraversalsHamilton graphs
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
Unnamed Item ⋮ On radius and typical properties of \(n\)-vertex graphs of given diameter ⋮ The set of all values of the domination number in trees with a given degree sequence ⋮ NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs ⋮ On the König graphs for a 5-path and its spanning supergraphs ⋮ Classification of graphs of diameter 2 ⋮ A weighted perfect matching with constraints on weights of its parts ⋮ Periodic and weakly periodic ground states for the Potts model with competing interactions on the Cayley tree ⋮ A combinatorial invariant of gradient-like flows on a connected sum of $\mathbb{S}^{n-1}\times\mathbb{S}^1$ ⋮ Asymptotic approximation for the number of n-vertex graphs of given diameter ⋮ Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A formula for the weight of a minimal filling of a finite metric space ⋮ Algebraic connectivity and degree sequences of trees ⋮ Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs ⋮ Center and its spectrum of almost all \(n\)-vertex graphs of given diameter ⋮ A Computable Structure with Non-Standard Computability
