Permanents, Pfaffian orientations, and even directed circuits.

Robertson, Neil; Seymour, P.D.; Thomas, Robin

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

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

Displaying similar documents to “Permanents, Pfaffian orientations, and even directed circuits.”

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).

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:

Matchings in infinite graphs

P. J. McCarthy (1978)

Czechoslovak Mathematical Journal

Similarity:

A note on the edge-connectivity of cages.

Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Perfect matching preservers.

Brualdi, Richard A., Loebl, Martin, Pangrác, Ondřej (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity: