✦ LIBER ✦

Reconstructing then-connected-components of a graph

✍ Scribed by D. L. Greenwell; R. L. Hemminger

Publisher: Springer
Year: 1972
Tongue: English
Weight: 47 KB
Volume: 8
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf01844516

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstructing the n-connected component

Reconstructing the n-connected components of a graph

✍ D. L. Greenwell; R. L. Hemminger 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 158 KB

Connected components of arithmetic graph

Connected components of arithmetic graphs

✍ Melvyn B. Nathanson 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 176 KB

On finding the strongly connected compon

On finding the strongly connected components in a directed graph

✍ Esko Nuutila; Eljas Soisalon-Soininen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Edge-reconstruction of 4-connected plana

Edge-reconstruction of 4-connected planar graphs

✍ S. Fiorini; J. Lauri 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB 👁 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

Edge-reconstruction of minimally 3-conne

Edge-reconstruction of minimally 3-connected planar graphs

✍ Yue Zhao 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 437 KB

Connected components of graphs and rever

Connected components of graphs and reverse mathematics

✍ Jeffry L. Hirst 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 644 KB