Matching Complexes of Trees and Applications of the Matching Tree Algorithm

A matching complex of a simple graph G is a simplicial complex with faces given by the matchings of G . The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa showed that matching complexes of forests are contractible or homoto...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of combinatorics Vol. 26; no. 4; pp. 1041 - 1075
Main Authors:	Jelić Milutinović, Marija, Jenne, Helen, McDonough, Alex, Vega, Julianne
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01-12-2022 Springer Nature B.V Springer
Subjects:	Algorithms caterpillar graph Combinatorics Graph theory Graphs homotopy type honeycomb graph Matching matching complex matching tree algorithm Mathematics MATHEMATICS AND COMPUTING Mathematics and Statistics Topology Trees (mathematics) Homotopy type Matching complex Honeycomb graph 05C70 Matching tree algorithm 05E45 05C69 Caterpillar graph
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!