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

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 7 of 7

Order by Relevance | Title | Year of publication

On a problem of Marco Buratti.

Horak, Peter; Rosa, Alexander — 2009

The Electronic Journal of Combinatorics [electronic only]

Generalized uniformly line vulnerable digraphs

Peter Horák — 1982

Časopis pro pěstování matematiky

Digraphs maximal with respect to connectivity

Peter Horák — 1979

Mathematica Slovaca

Digraphs maximal with respect to arc connectivity

Peter Horák — 1982

Mathematica Slovaca

Enumeration of graphs maximal with respect to connectivity

Peter Horák — 1982

Mathematica Slovaca

A note on removing a point of a strong digraph

Peter Horák — 1983

Mathematica Slovaca

On Hamiltonian cycles of complete $n$ -partite graphs

Peter Horák; Leoš Továrek — 1979

Mathematica Slovaca

Page 1

Download Results (CSV)