Pages that link to "Item:Q2192102"
From MaRDI portal
The following pages link to Matchings in graphs with a given number of cuts (Q2192102):
Displaying 12 items.
- Graphs with the fewest matchings (Q524194) (← links)
- On the number of matchings of graphs formed by a graph operation (Q867792) (← links)
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- A note on matching-cut in \(P_t\)-free graphs (Q2094374) (← links)
- Matching of \(5-\gamma \)-critical leafless graph with a cut edge (Q2423119) (← links)
- On the ordering of a class of graphs with respect to their matching numbers (Q2468691) (← links)
- Matchings in Graphs Variations of the Problem (Q3611943) (← links)
- Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited (Q3648510) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Matchings in bipartite graphs with a given number of cuts (Q6633545) (← links)
- Upper bounds for some graph invariants in terms of blocks and cut-vertices (Q6657261) (← links)
