Sciweavers

134 search results - page 5 / 27
» A note on generalized chromatic number and generalized girth
Sort
View
DM
1998
82views more  DM 1998»
13 years 7 months ago
Signed analogs of bipartite graphs
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
Thomas Zaslavsky
JGT
2010
103views more  JGT 2010»
13 years 6 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
13 years 9 months ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...
JCT
2006
73views more  JCT 2006»
13 years 7 months ago
Colouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 7 months ago
Generalized Modal Satisfiability
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor