Bounding the number of edges in permutation graphs.
Keevash, Peter, Loh, Po-Shen, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Acyclic sets in -majority tournaments.”
Bounding the number of edges in permutation graphs.
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.
Cyclic labellings with constraints at two distances.
Leese, R.A., Noble, S.D. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Equidimensionality of the Brauer loop scheme.
Rothbach, Brian (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dihedral -tilings of the sphere by equilateral and scalene triangles. II.
d'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Using homological duality in consecutive pattern avoidance.
Khoroshkin, Anton, Shapiro, Boris (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dihedral f-tilings of the sphere by equilateral and scalene triangles. III.
D'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Derangements and Euler's difference table for .
Faliharimalala, Hilarion L.M., Zeng, Jiang (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Statistics on the multi-colored permutation groups.
Bagno, Eli, Butman, Ayelet, Garber, David (2007)
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:
Large dimensional sets not containing a given angle
Viktor Harangi (2011)
Open Mathematics
Similarity:
We say that a set in a Euclidean space does not contain an angle α if the angle determined by any three points of the set is not equal to α. The goal of this paper is to construct compact sets of large Hausdorff dimension that do not contain a given angle α ∈ (0,π). We will construct such sets in ℝn of Hausdorff dimension c(α)n with a positive c(α) depending only on α provided that α is different from π/3, π/2 and 2π/3. This improves on an earlier construction (due to several authors)...
Evaluating a weighted graph polynomial for graphs of bounded tree-width.
Noble, S.D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: