JGT
2006
13 years 5 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
JGT
2006
13 years 5 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
JGT
2006
13 years 5 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
JGT
2006
13 years 5 months ago
2006
JGT
2006
13 years 5 months ago
2006
JGT
2006
13 years 5 months ago
2006
JGT
2006
13 years 5 months ago
2006
JGT
2006
13 years 5 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
JGT
2006
13 years 5 months ago
2006
JGT
2006
13 years 5 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...