Characterization of generic properties of linear structured systems for efficient computations

Christian Commault; Jean-Michel Dion; Jacob W. van der Woude

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

Displaying similar documents to “Characterization of generic properties of linear structured systems for efficient computations”

On the minimal length of the longest trail in a fixed edge-density graph

Vajk Szécsi (2013)

Open Mathematics

Similarity:

A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).

Permanents, Pfaffian orientations, and even directed circuits.

Robertson, Neil, Seymour, P.D., Thomas, Robin (1999)

Annals of Mathematics. Second Series

Similarity:

Analoga of Menger's theorem for polar and polarized graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Similarity:

Polar graphs and railway traffic

Bohdan Zelinka (1974)

Aplikace matematiky

Similarity:

Eulerian polar graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Similarity:

Even circuits of prescribed clockwise parity.

Fischer, Ilse, Little, C.H.C. (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity: