Realization of temporally connected graphs based on degree sequences
From MaRDI portal
Cites work
- A Cure for the Telephone Disease
- A Problem with Telephones
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- A survey of gossiping and broadcasting in communication networks
- Assigning times to minimise reachability in temporal graphs
- Decomposition of a Graph Realizing a Degree Sequence into Disjoint Spanning Trees
- Disjoint Representation of Tree Realizable Sequences
- Gossips and telephones
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3763989 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- Label-connected graphs and the gossip problem
- Line removal algorithms for graphs and their degree lists
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Parameterized algorithms for multi-label periodic temporal graph realization
- Recognizing and realizing temporal reachability graphs
- Simple, strict, proper, happy: a study of reachability in temporal graphs
- Some Properties of Graphs with Multiple Edges
- Temporal graph realization from fastest paths
- Temporal graph realization with bounded stretch
- The communication problem on graphs
- The complexity of optimal design of temporally connected graphs
This page was built for publication: Realization of temporally connected graphs based on degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364356)
