The following pages link to Reconstruction of Cacti (Q5578818):
Displaying 17 items.
- Extremal cacti of given matching number with respect to the distance spectral radius (Q1733732) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- Reconstruction of the set of branches of a graph (Q1911242) (← links)
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances (Q2197914) (← links)
- The reconstruction of outerplanar graphs (Q2264676) (← links)
- Zeroth-order general Randić index of cactus graphs (Q2293835) (← links)
- Graphs constructible from cycles and complete graphs (Q2359972) (← links)
- Reconstruction of maximal outerplanar graphs (Q2552507) (← links)
- Reconstructing the degree pair sequence of a digraph (Q2555081) (← links)
- Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number (Q2961481) (← links)
- ON α,β DESTRUCTIBLE GRAPHS (Q3333080) (← links)
- (Q3374778) (← links)
- On the spectral radius of cacti with<i>k</i>-pendant vertices (Q3564202) (← links)
- Graph reconstruction—a survey (Q4154892) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees (Q4971394) (← links)
