scientific article; zbMATH DE number 3831957
From MaRDI portal
Publication:3039368
Cited in
(39)- Large fault-tolerant interconnection networks
- 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
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
- Large regular graphs with no induced \(2K_ 2\)
- 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
- The vulnerability of the diameter of folded \(n\)-cubes
- Diameter vulnerability of GC graphs
- On the computational complexity of strong edge coloring
- Projective planes and congestion-free networks
- Design of survivable networks with vulnerability constraints
- Matchings and covers in hypergraphs
- On forwarding indices of networks
- Directed Moore hypergraphs
- Diameter vulnerability of iterated line digraphs
- Diameter-vulnerability of large bipartite digraphs
- Bus interconnection networks
- Bipartite biregular Moore graphs
- Strong edge coloring of Cayley graphs and some product graphs
- The degree-diameter problem for claw-free graphs and hypergraphs
- On the sum of all distances in a graph or digraph
- scientific article; zbMATH DE number 3972904 (Why is no real title available?)
- Problems on cycles and colorings
- On the minimum number of edges of two-connected graphs with given diameter
- The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
- Induced Turán numbers
- Maximizing line subgraphs of diameter at most \(t\)
- Cliques in \(C_4\)-free graphs of large minimum degree
- The covering radius of doubled 2-designs in \(2O_ k\)
- Some extended results on diameter-stable graphs
- On the number of spanning trees and Eulerian tours in iterated line digraphs
- A note on partial Cayley graphs
- On induced matchings
- Large graphs with given degree and diameter. II
- Induced matchings in bipartite graphs
- A note on the strong chromatic index of bipartite 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 Q3039368)
