We develop a connection between vertex coloring in graphs and star arboricity which allows us to prove that every planar graph has star arboricity at most 5. This settles an open problem raisedâ€¦ (More)

We consider vertex colorings of graphs in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of the coloring is the sum of the costsâ€¦ (More)

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment ofâ€¦ (More)

Microleakage measurements were made by use of a pressurized fluid method in Class I restorations prepared in extracted human teeth just prior to measuring the tensile bond strengths of the sameâ€¦ (More)

The well known problem of colouring the vertices of a graph with the minimum number of colours such that adjacent vertices are coloured differently is used in a variety of scheduling and storageâ€¦ (More)

The detection of servo information in hard disk drive read channels has traditionally been implemented with analog circuits and converted with an off-chip analog-to-digital converter (ADC). Theâ€¦ (More)