3008 search results - page 45 / 602 » Independence in connected graphs |
CORR
2011
Springer
14 years 7 months ago
2011
Springer
131
Voted
GC
2011
Springer
14 years 7 months ago
2011
Springer
191
Voted
AWIC
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. In this paper, we introduce DegExt, a graph-based languageindependent keyphrase extractor,which extends the keyword extraction method described in [6]. We compare DegExt ...
105
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
89
Voted
JGT
2007
15 years 18 days ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...