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:
Displaying similar documents to “Geodesic polyhedra and nets”
Dihedral -tilings of the sphere by equilateral and scalene triangles. II.
A gravitational effective action on a finite triangulation as a discrete model of continuous concepts
Albert Ko, Martin Roček (2006)
Archivum Mathematicum
Similarity:
We recall how the Gauss-Bonnet theorem can be interpreted as a finite dimensional index theorem. We describe the construction given in hep-th/0512293 of a function that can be interpreted as a gravitational effective action on a triangulation. The variation of this function under local rescalings of the edge lengths sharing a vertex is the Euler density, and we use it to illustrate how continuous concepts can have natural discrete analogs.
Acyclic sets in -majority tournaments.
Milans, Kevin G., Schreiber, Daniel H., West, Douglas B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Polygons with hidden vertices.
Ewald, Günter (2001)
Beiträge zur Algebra und Geometrie
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:
Bounding the number of edges in permutation graphs.
Keevash, Peter, Loh, Po-Shen, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Spherical F-tilings by triangles and -sided regular polygons, .
Avelino, Catarina P., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dihedral -tilings of the sphere by rhombi and triangles.
Breda, Ana M., Santos, Altino F. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Ideal triangulations of 3-manifolds II; taut and angle structures.
Kang, Ensil, Rubinstein, J.Hyam (2005)
Algebraic & Geometric Topology
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.