EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C99 None of the above, but in this section

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 25 Next

Displaying 481 – 500 of 584

Strong products of ?-critical graphs. (Summary).

Sandi Klavzar (1993)

Aequationes mathematicae

Strongly perfect products of graphs

Eugen Mândrescu (1991)

Czechoslovak Mathematical Journal

Strongly Self-Complementary and Hereditarily Isomorphic Tournaments.

C. Thomassen, K.B. Reid (1976)

Monatshefte für Mathematik

Subdeterminants and subgraphs

Antonín Vrba (1974)

Časopis pro pěstování matematiky

Sublattices of certain Coxeter lattices

Anne-Marie Bergé, Jacques Martinet (2005)

Journal de Théorie des Nombres de Bordeaux

In this paper, we describe the sublattices of some lattices, extending previous results of [Ber]. Our description makes intensive use of graphs.

Sufficient conditions for locally connected graphs

Donald W. Vanderjagt (1974)

Časopis pro pěstování matematiky

Sur deux invariants d'un corps de niveau fini

Jean-René Tort (1978)

Bulletin de la Société Mathématique de France

Sur la valeur maxima des indices de niveau en classification ascendante hiérarchique dans le cas de l'agrégation par la distance moyenne

M. Roux (1982)

Cahiers de l'analyse des données

Sur les sections des hypergraphes et sur leurs automorphismes

Francesco Speranza (1973)

Colloquium Mathematicae

SV40 assembly in vivo and in vitro.

Oppenheim, Ariella, Ben-Nun-Shaul, O., Mukherjee, S., Abd-El-Latif, M. (2008)

Computational & Mathematical Methods in Medicine

Symmetric embedding of finite lattices into finite partition lattices

Pavel Pudlák (1979)

Commentationes Mathematicae Universitatis Carolinae

Symmetric Laman theorems for the groups $𝒞_{2}$ and $𝒞_{s}$ .

Schulze, Bernd (2010)

The Electronic Journal of Combinatorics [electronic only]

Symmetrische Zerlegung von Kettenprodukten.

Martin Aigner (1975)

Monatshefte für Mathematik

Teilmengengraphen und projektive Räume.

Günter Pickert (1985)

Aequationes mathematicae

The Acyclic Polynomial Of A Graph

Ivan Gutman (1977)

Publications de l'Institut Mathématique

The acyclic polynomial of a graph.

I. Gutman (1977)

Publications de l'Institut Mathématique [Elektronische Ressource]

The adjacency graphs of a complex

A. K. Dewdney, Frank Harary (1976)

Czechoslovak Mathematical Journal

The algebraic multiplicity of the number zero in the spectrum of a bipartite graph

D. M. Cvetković, I. M. Gutman (1972)

Matematički Vesnik

The all-paths transit function of a graph

Manoj Changat, Sandi Klavžar, Henry Martyn Mulder (2001)

Czechoslovak Mathematical Journal

A transit function $R$ on a set $V$ is a function $R V \times V \to 2^{V}$ satisfying the axioms $u \in R (u, v)$ , $R (u, v) = R (v, u)$ and $R (u, u) = {u}$ , for all $u, v \in V$ . The all-paths transit function of a connected graph is characterized by transit axioms.

The assignment problem with three job categories

Angeline Brandt, Jakub Intrator (1971)

Časopis pro pěstování matematiky

Currently displaying 481 – 500 of 584

Previous Page 25 Next