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 “Yamada polynomial and crossing number of spatial graphs.”

Combinatorics and topology - François Jaeger's work in knot theory

Louis H. Kauffman (1999)

Annales de l'institut Fourier

Similarity:

François Jaeger found a number of beautiful connections between combinatorics and the topology of knots and links, culminating in an intricate relationship between link invariants and the Bose-Mesner algebra of an association scheme. This paper gives an introduction to this connection.

On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six

Marián Klešč, Štefan Schrötter (2013)

Discussiones Mathematicae Graph Theory

Similarity:

The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of crossing numbers were obtained. The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. Moreover, except of six graphs, the crossing numbers of Cartesian products G⃞K1,n for...