On the hyperspace of subcontinua of a finite graph, II
R. Duda (1968)
Fundamenta Mathematicae
Similarity:
R. Duda (1968)
Fundamenta Mathematicae
Similarity:
J. Roberts (1965)
Fundamenta Mathematicae
Similarity:
Harold Bell, Ezra Brown, R. Dickamn, E. Green (1981)
Fundamenta Mathematicae
Similarity:
J. Cornette (1966)
Fundamenta Mathematicae
Similarity:
R. Duda (1970)
Fundamenta Mathematicae
Similarity:
A. Kosiński (1959)
Fundamenta Mathematicae
Similarity:
Ruo-Wei Hung, Maw-Shang Chang (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every vertex not in CD is adjacent to at least one vertex in CD, and the subgraph induced by CD is connected. We show that, given an arc family F with endpoints sorted, a minimum-cardinality connected dominating set of the circular-arc graph constructed from F can be computed in O(|F|) time.
Casimir Zarankiewicz (1955)
Fundamenta Mathematicae
Similarity:
Christian, Robin, Richter, R.Bruce, Rooney, Brendan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
J. Chartonik, S. Miklos (1981)
Fundamenta Mathematicae
Similarity: