EuDML | Browse

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.

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

Displaying 1 – 6 of 6

Laplacian of graphs and algebraic connectivity

Miroslav Fiedler (1989)

Banach Center Publications

Locally disconnected graphs with large numbers of edges

Zdeněk Ryjáček, Bohdan Zelinka (1987)

Mathematica Slovaca

Locally tree-like graphs

Bohdan Zelinka (1983)

Časopis pro pěstování matematiky

Long induced paths in 3-connected planar graphs

Jorge Luis Arocha, Pilar Valencia (2000)

Discussiones Mathematicae Graph Theory

It is shown that every 3-connected planar graph with a large number of vertices has a long induced path.

Long path lemma concerning connectivity and independence number.

Fujita, Shinya, Halperin, Alexander, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Longest circuits in triangular and quadrangular $3$ -polytopes with two types of edges

Stanislav Jendroľ, Roman Kekeňák (1990)

Mathematica Slovaca

Currently displaying 1 – 6 of 6

Page 1