EUDML | Face-width of embedded graphs

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.

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.

Displaying similar documents to “Face-width of embedded graphs”

Diagonalizable embedding of composition graphs

Mohammed Z. Abu-Sbeih (1999)

Mathematica Slovaca

Similarity:

Face size and the maximum genus of a graph. II: Nonsimple graphs

Yuanqiu Huang, Yan Pei Liu (2001)

Mathematica Slovaca

Similarity:

Remarks on diagonalizable embeddings of graphs

Roman Nedela, Martin Škoviera (1990)

Mathematica Slovaca

Similarity:

Orientably simple graphs

Torrence D. Parsons, Giustina Pica, Tomaž Pisanski, Aldo G. S. Ventre (1987)

Mathematica Slovaca

Similarity:

Quadrilateral embeddings of the conjunction of graphs

Vladimír Železník (1988)

Mathematica Slovaca

Similarity: