scientific article; zbMATH DE number 3627227
From MaRDI portal
Publication:4189309
Cited in
(38)- Minimally k-connected graphs of low order and maximal size
- Hyperconnectivity of graphs
- Large fault-tolerant interconnection networks
- 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
- On mixed connectivity certificates
- Decomposition of the product of cycles based on degree partition
- Critical vertices in k-connected digraphs
- On minimally 2-T-connected directed graphs
- On minimally \((n,\lambda)\)-connected graphs
- Ramsey theory for highly connected monochromatic subgraphs
- Mixed connectivity properties of random graphs and some special graphs
- The complexity of mixed-connectivity
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- Game connectivity of graphs
- Finding densest \(k\)-connected subgraphs
- On the sizes of vertex-k-maximal r-uniform hypergraphs
- Realizability of fault-tolerant graphs
- On connected partition with degree constraints
- On Connectivity in Matroids and Graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- On minimum locally n-(arc)-strong digraphs
- Ramsey theory for graph connectivity
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- The generalized 4-connectivity of hypercubes
- On mixed connectivity certificates
- Highly Connected Subgraphs with Large Chromatic Number
- On the mixed connectivity conjecture of Beineke and Harary
- A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
- What is on his mind?
- Girth in graphs
- Sparse connectivity certificates via MA orderings in graphs
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189309)
