Evaluating a weighted graph polynomial for graphs of bounded tree-width.
Noble, S.D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Noble, S.D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jiří Vinárek (1987)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Rahmat A. Khan, Bashir Ahmad (2005)
Archivum Mathematicum
Similarity:
In this paper, we develop a generalized quasilinearization technique for a nonlinear second order periodic boundary value problem and obtain a sequence of approximate solutions converging uniformly and quadratically to a solution of the problem. Then we improve the convergence of the sequence of approximate solutions by establishing the convergence of order .
T. Karthick, C.R. Subramanian (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path on 4 vertices is bi-colored. The star chromatic number of G, χs(G), is the minimum number of colors needed to star color G. In this paper, we show that if a graph G is either non-regular subcubic or cubic with girth at least 6, then χs(G) ≤ 6, and the bound can be realized in linear time.
Alikhani, Saeid, Peng, Yee-Hock (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity: