Pages that link to "Item:Q641542"
From MaRDI portal
The following pages link to A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542):
Displaying 13 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← links)
- Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
- The maximum spectral radius of \(t\)-connected graphs with bounded matching number (Q2075523) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- Co-density and fractional edge cover packing (Q2175043) (← links)
- Linear hypergraphs with large transversal number and maximum degree two (Q2441629) (← links)
- Irreducible triangulations of surfaces with boundary (Q2637719) (← links)
- Trees and acyclic matrices over arbitrary fields (Q2787609) (← links)
- The matchings and spectral radius of graphs involving minimum degree (Q6102093) (← links)