Weighted coloring on planar, bipartite and split graphs: complexity and approximation

The effects of proportion of finance CEOs increase the rate of marketing CEOs rather than finance CEOs, significant at the .10 level for Models I and II,. and at the .05 level for

By following a strategy to introduce deep permanent traps near the surface in controlled way, we have recently reported [7, 8] on a very efficient method for charge

We tested three methods: (1) downsampling, (2) using a sliding window, and (3) estimating a bounding box with downsampled input and running the network again on that region at

Finally a simulation methodology to predict the impact of circuit aging on conducted susceptibility and emission is presented and applied to predict a PLL

Note that the obtained coloring is legitimate, because in each case the other vertices adjacent to z ∗ received the color c.. Lemma 4.2 (Reducing two vertices connected by a

Assume A is a family of connected planar graphs that satisfies the previous condition, and let X n denote the number of connected components that belong to A in a random planar

An acyclic edge coloring of a graph G is a proper edge coloring with an additional condition that any pair of colors induces a linear forest (an acyclic graph with maximum degree

Two instruments were used to measure student growth: the Crites Vocational Maturity Inventory and the Secondary Self Concept Questionnaire developed by the North York Board