278 search results - page 6 / 56 » Two Upper Bounds on the Chromatic Number |
SIAMDM
2008
13 years 7 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
AML
2006
13 years 7 months ago
2006
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
COMBINATORICS
1999
13 years 7 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
MOC
2000
13 years 7 months ago
2000
Lower bounds for the condition numbers of the preconditioned systems are obtained for the Bramble-Pasciak-Schatz substructuring preconditioner and the Neumann-Neumann preconditione...