scientific article; zbMATH DE number 4137792
From MaRDI portal
zbMATH Open0695.05029MaRDI QIDQ3470486FDOQ3470486
Authors: Fan Chung 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cited In (36)
- Steiner 4-diameter, maximum degree and size of a graph
- On the maximum diameter of \(k\)-colorable graphs
- Title not available (Why is that?)
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- Distance-based index structures for fast similarity search
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
- Bounds on the hyperbolicity constant
- Maximal outerplane graphs of extremal diameter
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Bounded-call broadcasting
- Christmas tree: a versatile 1-fault-tolerant design for token rings
- Reducing the diameter of a unit disk graph via node addition
- Multidimensional linear congruential graphs
- Title not available (Why is that?)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
- An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power
- Graph theoretical issues in computer networks
- Decreasing the diameter of bounded degree graphs
- Concerning the number of edges in a graph with diameter constraints
- Graphs with small diameter after edge deletion
- Beyond Helly graphs: the diameter problem on absolute retracts
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
- Augmenting forests to meet odd diameter requirements
- A hypercube variant with small diameter
- Large fault-tolerant interconnection networks
- Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
- Complexity and algorithms for constant diameter augmentation problems
- A cut locus for finite graphs and the farthest point mapping
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Shortcutting directed and undirected networks with a degree constraint
- The diameter variability of the Cartesian product of graphs
- Shortcuts for the circle
- Title not available (Why is that?)
- Shortcuts for the circle
- Title not available (Why is that?)
- Title not available (Why is that?)
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 Q3470486)
