1395 search results - page 37 / 279 » (k, )-Distance-Hereditary Graphs |
106
click to vote
GC
2007
Springer
14 years 11 months ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
106
click to vote
EJC
2011
14 years 6 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
DM
2008
14 years 12 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, hamiltonian...
ARSCOM
2008
14 years 12 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
118
click to vote
GC
2008
Springer
14 years 12 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...