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

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

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

Page 1 Next

Displaying 1 – 20 of 36

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

The collapsibility of hexagon 2-complexes with the 12-property.

Lazăr, Ioana-Claudia (2011)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

The dependence of some logical axioms on disjoint transversals and linked systems

A. Schrijver (1978)

Colloquium Mathematicae

The distance between a graph and its complement

Bohdan Zelinka (1987)

Czechoslovak Mathematical Journal

The existence of 2-factors in squares of graphs

Yousef Alavi, Gary Chartrand (1975)

Czechoslovak Mathematical Journal

The forcibly-tree and forcibly-unicyclic degree sequences.

F. Harary, G. Exoo (1982)

Elemente der Mathematik

The Hadwiger number of an infinite graph

Bohdan Zelinka (1976)

Mathematica Slovaca

The intersection graph on an ordered commutative semigroup.

B. Pondelicek (1980)

Semigroup forum

The join of graphs and the binding minimality

Maria Kwaśnik, Danuta Michalak (1989)

Časopis pro pěstování matematiky

The lattice of integral flows and the lattice of integral cuts on a finite graph

Roland Bacher, Pierre de La Harpe, Tatiana Nagnibeda (1997)

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

The min-max supergraph

Gary Chartrand, Ronald J. Gould, S. F. Kapoor (1980)

Mathematica Slovaca

The neighborhood characteristic parameter for graphs.

McKee, Terry A. (2003)

The Electronic Journal of Combinatorics [electronic only]

The Number of Non-Isomorphic Hamiltonian Circuits in an $n$ -Dimensional Cube

Bohdan Zelinka (1974)

Matematický časopis

The orientability of the direct product of graphs

Eva Gedeonová (1981)

Mathematica Slovaca

Currently displaying 1 – 20 of 36

Page 1 Next