Sum of squares of degrees in a graph.

Ábrego, Bernardo M.; Fernández-Merchant, Silvia; Neubauer, Michael G.; Watkins, William

Displaying similar documents to “Sum of squares of degrees in a graph.”

The lattice of threshold graphs.

Merris, Russell, Roby, Tom (2005)

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Similarity:

Evaluating a weighted graph polynomial for graphs of bounded tree-width.

Noble, S.D. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bonferroni-Galambos inequalities for partition lattices.

Dohmen, Klaus, Tittmann, Peter (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Star Coloring of Subcubic Graphs

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.