Einige Bemerkungen über freie Kategorien und freie Gruppoide
Displaying 1581 – 1600 of 5365
Either tournaments or algebras? (Preliminary communication)
Vladimír Müller, Jaroslav Nešetřil, Jan Pelant (1972)
Commentationes Mathematicae Universitatis Carolinae
El diámetro de ciertos digrafos circulantes de triple paso.
Paz Morillo Bosch, Miguel Angel Fiol Mora (1986)
Stochastica
This paper studies some diameter-related properties of the 3-step circulant digraphs with set of vertices V≡ZN and steps (± a,b). More precisely, it concentrates upon maximizing their order N for any fixed value of their diameter k. In the proposed geometrical approach, each digraph is fully represented by a T-shape tile which tessellates periodically the plane. The study of these tiles leads to the optimal solutions.
Elementary proof of the reality of the zeros of beta-polynomials of complete graphs
Xueliang Li, Ivan Gutman (2000)
Kragujevac Journal of Mathematics
Elementary proofs and the sums differences problem.
Nets Hawk Katz (2006)
Collectanea Mathematica
In this paper, we rule out the possibility that a certain method of proof in the sums differences conjecture can settle the Kakeya Conjecture.
Elevation of a graph
Ľudovít Niepel, Pavel Tomasta (1981)
Czechoslovak Mathematical Journal
Elimination of local bridges
Martin Juvan, Jože Marinček, Bojan Mohar (1997)
Mathematica Slovaca
e-locally acyclic graphs
D. Fronček (1991)
Applicationes Mathematicae
Elongation in a graph
Bohdan Zelinka (1982)
Mathematica Slovaca
Embedding a forest in a graph.
Goldberg, Mark K., Magdon-Ismail, Malik (2011)
The Electronic Journal of Combinatorics [electronic only]
Embedding complete ternary trees into hypercubes
S.A. Choudum, S. Lavanya (2008)
Discussiones Mathematicae Graph Theory
We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of dimension at most ⎡(1.6)h⎤+1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of Tₕ into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of Tₕ into its optimal hypercube with load 1 and dilation 2. The optimal hypercube has dimension ⎡(log₂3)h⎤ ( = ⎡(1.585)h⎤) or ⎡(log₂3)h⎤+1....
Embedding graphs in their complements
Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Seymour Schuster (1981)
Czechoslovak Mathematical Journal
Embedding infinite trees into a cube of infinite dimension
Bohdan Zelinka (1972)
Časopis pro pěstování matematiky
Embedding -quasistars into -cubes
Ladislav Nebeský (1988)
Czechoslovak Mathematical Journal
Embedding the polytomic tree into the -cube
Ivan Havel, Petr Liebl (1973)
Časopis pro pěstování matematiky
Embedding trees into block graphs
Bohdan Zelinka (1976)
Czechoslovak Mathematical Journal
Embedding trees into clique-bridge-clique graphs
Bohdan Zelinka (1979)
Časopis pro pěstování matematiky
Embedding vertices at points: Few bends suffice for planar graphs.
Kaufmann, Michael, Wiese, Roland (2002)
Journal of Graph Algorithms and Applications
Embeddings of 2-spheres in 4-manifolds.
Nikolaos Askitas (1996)
Manuscripta mathematica
Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups.
Crisp, John, Wiest, Bert (2004)
Algebraic & Geometric Topology