223 search results - page 19 / 45 » A Note on Graph Pebbling |
DAM
2007
13 years 7 months ago
2007
This note extends results of Fern´andez, Leighton, and L´opez-Presa on the uniqueness of rth roots for disconnected graphs with respect to the Cartesian product to other product...
DAM
2000
13 years 7 months ago
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
ARSCOM
2008
13 years 7 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, ...
IJCAI
1989
13 years 8 months ago
1989
This paper will present a generalisation of chart parsing able to cope with the case where the object being parsed is a particular kind of diagram (a flowgraph) and the grammar is...
JCT
2008
13 years 7 months ago
2008
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this note, we prove that if G is a graph such that for each edge xy E...