74 search results - page 8 / 15 » arscom 2007 |
ARSCOM
2006
14 years 9 months ago
2006
A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph ...
ARSCOM
2005
14 years 9 months ago
2005
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
ARSCOM
2005
14 years 9 months ago
2005
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
ARSCOM
2005
14 years 9 months ago
2005
We prove several results dealing with various counting functions for partitions of an integer into four squares of equal parity. Some are easy consequences of earlier work, but tw...
ARSCOM
2005
14 years 9 months ago
2005
A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two dis...