Three-dimensional pseudomanifolds on eight vertices.
Datta, Basudeb, Nilakantan, Nandini (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Datta, Basudeb, Nilakantan, Nandini (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Lutz, Frank H., Sulanke, Thom, Swartz, Ed (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Lawrencenko, Serge, Negami, Seiya, Sabitov, Idjad Kh. (2002)
Beiträge zur Algebra und Geometrie
Similarity:
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Paul, Alice, Pippenger, Nicholas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yolandé Jacobs, Elizabeth Jonck, Ernst Joubert (2013)
Open Mathematics
Similarity:
Let G = (V, E) be a simple graph of order n and i be an integer with i ≥ 1. The set X i ⊆ V(G) is called an i-packing if each two distinct vertices in X i are more than i apart. A packing colouring of G is a partition X = {X 1, X 2, …, X k} of V(G) such that each colour class X i is an i-packing. The minimum order k of a packing colouring is called the packing chromatic number of G, denoted by χρ(G). In this paper we show, using a theoretical proof, that if q = 4t, for some integer t...
Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen (2014)
Discussiones Mathematicae Graph Theory
Similarity:
It is known that there are normal plane maps M5 with minimum degree 5 such that the minimum degree-sum w(S5) of 5-stars at 5-vertices is arbitrarily large. In 1940, Lebesgue showed that if an M5 has no 4-stars of cyclic type (5, 6, 6, 5) centered at 5-vertices, then w(S5) ≤ 68. We improve this bound of 68 to 55 and give a construction of a (5, 6, 6, 5)-free M5 with w(S5) = 48
Ali Ahmad, E.T. Baskoro, M. Imran (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. We...