JGT
2006
13 years 4 months ago
2006
JGT
2006
13 years 4 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...
JGT
2006
13 years 4 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
JGT
2006
13 years 4 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
JGT
2006
13 years 4 months ago
2006
JGT
2006
13 years 4 months ago
2006
JGT
2006
13 years 4 months ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
JGT
2006
13 years 4 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
JGT
2006
13 years 4 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
JGT
2006
13 years 4 months ago
2006
This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have