The following pages link to (Q3039368):
Displaying 39 items.
- Problems on cycles and colorings (Q383772) (← links)
- On the minimum number of edges of two-connected graphs with given diameter (Q409426) (← links)
- Cliques in \(C_4\)-free graphs of large minimum degree (Q524175) (← links)
- Some extended results on diameter-stable graphs (Q614328) (← links)
- On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922) (← links)
- A note on partial Cayley graphs (Q685657) (← links)
- On induced matchings (Q687143) (← links)
- Large graphs with given degree and diameter. II (Q793749) (← links)
- Induced matchings in bipartite graphs (Q921017) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity) (Q1122506) (← links)
- Extensions of networks with given diameter (Q1123211) (← links)
- Fault-tolerant routings in Kautz and de Bruijn networks (Q1123801) (← links)
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks (Q1179732) (← links)
- Large regular graphs with no induced \(2K_ 2\) (Q1196569) (← links)
- Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs (Q1199425) (← links)
- Graphs on alphabets as models for large interconnection networks (Q1199426) (← links)
- The covering radius of Hadamard codes in odd graphs (Q1199453) (← links)
- The vulnerability of the diameter of folded \(n\)-cubes (Q1377783) (← links)
- Diameter vulnerability of GC graphs (Q1408451) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Projective planes and congestion-free networks (Q1613417) (← links)
- Design of survivable networks with vulnerability constraints (Q1698886) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On forwarding indices of networks (Q1823868) (← links)
- Directed Moore hypergraphs (Q1902896) (← links)
- Diameter vulnerability of iterated line digraphs (Q1910577) (← links)
- Diameter-vulnerability of large bipartite digraphs (Q1917252) (← links)
- Bus interconnection networks (Q1917343) (← links)
- Bipartite biregular Moore graphs (Q1981708) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs (Q2874093) (← links)
- On the sum of all distances in a graph or digraph (Q3344025) (← links)
- (Q3739159) (← links)
- The diameter vulnerability of the generalized Petersen graphGP[tk;k] (Q4633381) (← links)
- Induced Turán Numbers (Q4643317) (← links)
- Maximizing Line Subgraphs of Diameter at Most t (Q5071098) (← links)
- The covering radius of doubled 2-designs in \(2O_ k\) (Q5905437) (← links)
