scientific article
From MaRDI portal
Publication:3039368
zbMath0525.05018MaRDI QIDQ3039368
No author found.
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Connectivity (05C40) Graph theory (05Cxx)
Related Items (39)
Projective planes and congestion-free networks ⋮ Directed Moore hypergraphs ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ Diameter vulnerability of iterated line digraphs ⋮ Diameter-vulnerability of large bipartite digraphs ⋮ Bus interconnection networks ⋮ Large fault-tolerant interconnection networks ⋮ The vulnerability of the diameter of folded \(n\)-cubes ⋮ Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity) ⋮ Extensions of networks with given diameter ⋮ Fault-tolerant routings in Kautz and de Bruijn networks ⋮ Problems on cycles and colorings ⋮ Some extended results on diameter-stable graphs ⋮ On the minimum number of edges of two-connected graphs with given diameter ⋮ Design of survivable networks with vulnerability constraints ⋮ Diameter vulnerability of GC graphs ⋮ Induced matchings in bipartite graphs ⋮ A note on the strong chromatic index of bipartite graphs ⋮ The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks ⋮ The diameter vulnerability of the generalized Petersen graphGP[tk;k] ⋮ Bipartite biregular Moore graphs ⋮ On the number of spanning trees and Eulerian tours in iterated line digraphs ⋮ Induced Turán Numbers ⋮ Large regular graphs with no induced \(2K_ 2\) ⋮ The covering radius of doubled 2-designs in \(2O_ k\) ⋮ A note on partial Cayley graphs ⋮ Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs ⋮ Graphs on alphabets as models for large interconnection networks ⋮ The covering radius of Hadamard codes in odd graphs ⋮ On induced matchings ⋮ Cliques in \(C_4\)-free graphs of large minimum degree ⋮ On the sum of all distances in a graph or digraph ⋮ Unnamed Item ⋮ Matchings and covers in hypergraphs ⋮ On forwarding indices of networks ⋮ Large graphs with given degree and diameter. II ⋮ On the computational complexity of strong edge coloring ⋮ The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs ⋮ Strong edge coloring of Cayley graphs and some product graphs
This page was built for publication:
