Reconstruction of Cacti

DOI10.4153/CJM-1969-149-3zbMath0187.21401WikidataQ57074822 ScholiaQ57074822MaRDI QIDQ5578818

Dennis P. Geller, Bennet Manvel

Publication date: 1969

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (17)

Graphs constructible from cycles and complete graphs ⋮ Reconstruction of the set of branches of a graph ⋮ On the complexity of graph reconstruction ⋮ On a conjecture for the signless Laplacian spectral radius of cacti with given matching number ⋮ Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances ⋮ Unnamed Item ⋮ Extremal cacti of given matching number with respect to the distance spectral radius ⋮ On the spectral radius of cacti withk-pendant vertices ⋮ ON α,β DESTRUCTIBLE GRAPHS ⋮ The reconstruction of outerplanar graphs ⋮ Graph reconstruction—a survey ⋮ Dyadic representations of graphs ⋮ Zeroth-order general Randić index of cactus graphs ⋮ Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees ⋮ Reconstructing Cactus Graphs from Shortest Path Information ⋮ Reconstruction of maximal outerplanar graphs ⋮ Reconstructing the degree pair sequence of a digraph

This page was built for publication: Reconstruction of Cacti