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:
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.
Grosjean, Carl C. (1996)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
D'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Khelifi, Abdessatar (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
Jiří Vinárek (1987)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Dohmen, Klaus, Tittmann, Peter (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
De Coster, C., Habets, P. (1996)
Portugaliae Mathematica
Similarity:
Adegoke, Kunle, Layeni, Olawanle (2010)
Applied Mathematics E-Notes [electronic only]
Similarity:
Bagno, Eli, Butman, Ayelet, Garber, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: