Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Non-recursively constructible recursive families of graphs

From MaRDI portal
Publication:426873
Jump to:navigation, search

zbMath1243.05116MaRDI QIDQ426873

Aaron Ostrander, Christina Graves, Gregory Palma, Colleen M. Bouey

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p9


zbMATH Keywords

Tutte polynomial


Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)


Related Items (1)

Recurrence relations for graph polynomials on bi-iterative families of graphs







This page was built for publication: Non-recursively constructible recursive families of graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:426873&oldid=12301802"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki