scientific article; zbMATH DE number 3627227
From MaRDI portal
Publication:4189309
zbMath0404.05040MaRDI QIDQ4189309
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (36)
Hyperconnectivity of graphs ⋮ On minimum locally $n$-(arc)-strong digraphs ⋮ Decomposition of the product of cycles based on degree partition ⋮ Sparse connectivity certificates via MA orderings in graphs ⋮ Large fault-tolerant interconnection networks ⋮ On connected partition with degree constraints ⋮ Critical vertices in \(k\)-connected digraphs ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ On the number of edges in a graph with no \((k + 1)\)-connected subgraphs ⋮ Highly Connected Subgraphs with Large Chromatic Number ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ On Connectivity in Matroids and Graphs ⋮ Game connectivity of graphs ⋮ 2-linked graphs ⋮ On multiply critically h-connected graphs ⋮ Circuits through specified edges ⋮ On a conjecture of Entringer and Slater ⋮ The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ Finding densest \(k\)-connected subgraphs ⋮ The generalized 4-connectivity of hypercubes ⋮ On mixed connectivity certificates ⋮ What is on his mind? ⋮ Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs ⋮ Ramsey theory for highly connected monochromatic subgraphs ⋮ On minimally 2-\(T\)-connected directed graphs ⋮ Mixed connectivity properties of random graphs and some special graphs ⋮ On mixed connectivity certificates ⋮ The complexity of mixed-connectivity ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ Girth in graphs ⋮ Minimally k-connected graphs of low order and maximal size ⋮ Ramsey theory for graph connectivity ⋮ On minimally \((n,\lambda)\)-connected graphs ⋮ Realizability of fault-tolerant graphs
This page was built for publication:
