Acyclic sets in -majority tournaments.
Milans, Kevin G., Schreiber, Daniel H., West, Douglas B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Milans, Kevin G., Schreiber, Daniel H., West, Douglas B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Khoroshkin, Anton, Shapiro, Boris (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Leese, R.A., Noble, S.D. (2004)
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.
d'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Brändén, Petter, Claesson, Anders (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, William Y.C., Zhang, Jessica C.Y. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Reifegerste, Astrid (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hegarty, Peter (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Björner, Anders, Brenti, Francesco (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Brignall, Robert (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Novick, Mordechai (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Firro, Ghassan, Mansour, Toufik, Wilson, Mark C. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: