51 search results - page 9 / 11 » jgt 2006 |
JGT
2010
13 years 4 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
JGT
2010
13 years 4 months ago
2010
: A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant...
JGT
2006
13 years 6 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 6 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...
JGT
2006
13 years 6 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...