An iteration method for connected graphs

Marcel Wellner

Type: Article

Publication Date: 1962-06-01

Citations: 3

DOI: https://doi.org/10.1007/bf02751466

View Publication

Locations

Il Nuovo Cimento - View

Similar Works

Action	Title	Year	Authors
+	A Correspondence between Eulid’s Division Method and Bipartite Graph	2021	长松金
+	An iteration method	1971	S. M. Shugrin
+	Graphing Methods	2024	A. J. Larner
+	A network approach based on cliques	2013	Inácio de Sousa Fadigas Hernane Borges de Barros Pereira
+	Cycle-connected mixed graphs and related problems	2023	Junran Lichen
+	Product Methods And G-Connectedness	2020	L. Liu Zheng Ping
+ PDF Chat	A heuristic approach for dividing graphs into bi-connected components with a size constraint	2017	Raka Jovanović Tatsushi Nishi Stefan Voß
+	On a probabilistic method in graph theory	1981	D. L. Greenwell D. G. Hoffman
+	Methods for Investigating Connectivity of Large Graphs	1969	Daniel J. Kleitman
+	An improvement of a recent closed graph theorem	2008	Shuhui Zhong Ronglu Li Sok Yoo Won
+ PDF Chat	Contraction obstructions for connected graph searching	2015	Micah J. Best Arvind Gupta Dimitrios M. Thilikos Dimitris Zoros
+	Calculating the Connectivity of a Directed Graph	1987	David W. Matula Rakesh Vohra
+	Simple concurrent labeling algorithms for connected components	2019	Sixue Liu Robert E. Tarjan
+	An implicit degree sum condition for cycles through specified vertices	2017	Xing Huang
+	Hamiltonian cycles of a connected graph	1968	L. M. Likhtenbaum
+	A practical algorithm for making filled graphs minimal	2001	Jean R. S. Blair Pinar Heggernes Jan Arne Telle
+	Enumeration of connected graphs with cut vertices	1999	應烈金
+	Enumeration of connected graphs with cut vertices	2002	Yinglie Jin Shinsei Tazawa Teruhiro Shirakura
+	Connectivity Algorithm	2015	Krishnendra Shekhawat
+	Graph theory and the PPP method	1991	K. Balasubramanian

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors