1395 search results - page 48 / 279 » (k, )-Distance-Hereditary Graphs |
CPC
2006
14 years 9 months ago
2006
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...
IPL
2007
14 years 9 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
ALGORITHMICA
2006
14 years 9 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
103
click to vote
JCO
2007
14 years 9 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
ISCI
2011
14 years 4 months ago
2011
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional...