547 search results - page 85 / 110 » dm 2008 |
121
Voted
DM
2002
15 years 17 days ago
2002
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
101
Voted
DM
2002
15 years 17 days ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
111
Voted
DM
2002
15 years 17 days ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
80
Voted
DM
2002
15 years 17 days ago
2002
In this paper, we present several conditions for K1,3-free graphs, which guarantee the graph is subpancyclic. In particular, we show that every K1,3-free graph with minimum degree...
90
Voted
DM
2002
15 years 17 days ago
2002
It is proved in this paper that for m 0; 2; 6; 10 (mod 12) there exists a resolvable group divisible design of order v, block size 4 and group size m if and only v 0 (mod 4), v ...