Pages that link to "Item:Q925308"
From MaRDI portal
The following pages link to Complexes of graphs with bounded matching size (Q925308):
Displaying 15 items.
- Bounded degree complexes of forests (Q785805) (← links)
- The clique complex and hypergraph matching (Q873650) (← links)
- Capacities of graphs and \(2\)-matchings (Q1584259) (← links)
- Matching complexes of small grids (Q2001978) (← links)
- Higher matching complexes of complete graphs and complete bipartite graphs (Q2075514) (← links)
- Leray numbers of complexes of graphs with bounded matching number (Q2120834) (← links)
- Topology of matching, chessboard, and general bounded degree graph complexes (Q2496172) (← links)
- Matching complexes of \(3 \times n\) grid graphs (Q2665955) (← links)
- A characterization of two-dimensional Buchsbaum matching complexes (Q2692175) (← links)
- Matching for Graphs of Bounded Degree (Q3507330) (← links)
- Topology of clique complexes of line graphs (Q5045261) (← links)
- Filtered matchings and simplicial complexes (Q5080926) (← links)
- Complexes of graphs with bounded independence number (Q5918951) (← links)
- Perfect matching complexes of honeycomb graphs (Q6106302) (← links)
- Topology of cut complexes of graphs (Q6552470) (← links)