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

On the number of \(F\)-matchings in a tree

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

zbMath1243.05201MaRDI QIDQ426809

Hiu-Fai Law

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/v19i1p43


zbMATH Keywords

random labeled tree


Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)


Related Items (1)

On the number of \(r\)-matchings in a tree







This page was built for publication: On the number of \(F\)-matchings in a tree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:426809&oldid=12301468"
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