Irreducibility of the tutte polynomial of an embedded graph

HIGHLIGHTS

• who: Joanna A. Ellis-Monaghan and collaborators from the (UNIVERSITY) have published the research: Irreducibility of the Tutte polynomial of an embedded graph, in the Journal: (JOURNAL)

SUMMARY

The Tutte polynomial of a graph G=(V, E) can be defined by X T (G; x, y):=(x - 1)r(E)-r(A) (y - 1)|A|-r(A), A⊆E @@

ACRONYMS

LAY DEFINITIONS

Licence: cc-by

Site reference: https://alco.centre-mersenne . . .

 

If you want to have access to all the content you need to log in!

Thanks :)

Username or Email

Password

Remember me

Lost your password?

If you don't have an account, you can create one here.