1395 search results - page 22 / 279 » (k, )-Distance-Hereditary Graphs |
JCT
2011
13 years 3 months ago
2011
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
ICRA
1994
IEEE
13 years 12 months ago
1994
IEEE
APPML
2011
13 years 3 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
DM
2008
13 years 8 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...