3008 search results - page 12 / 602 » Independence in connected graphs |
WG
2007
Springer
14 years 1 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
COMBINATORICA
2006
13 years 7 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
CHI
2004
ACM
14 years 7 months ago
2004
ACM
The focus of this panel will be on aging and technology. The intent is to demonstrate how technology can be used to help older adults remain independent, productive and connected ...