1395 search results - page 55 / 279 » (k, )-Distance-Hereditary Graphs |
EJC
2010
14 years 9 months ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
JGT
2008
14 years 9 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
JGT
2007
14 years 9 months 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...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
110
click to vote
DCG
2011
14 years 4 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...