Pages that link to "Item:Q5826303"
From MaRDI portal
The following pages link to A Short Proof of the Factor Theorem for Finite Graphs (Q5826303):
Displaying 22 items.
- On parallel complexity of maximum f-matching and the degree sequence problem (Q5096889) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS (Q5470176) (← links)
- Signed graph factors and degree sequences (Q5471057) (← links)
- (Q5708503) (← links)
- Noncontextual coloring of orthogonality hypergraphs (Q5883898) (← links)
- Local Dirac's condition on the existence of 2-factor (Q6041862) (← links)
- Diverse Pairs of Matchings (Q6065425) (← links)
- Simple reduction of f-colorings to edge-colorings (Q6085710) (← links)
- A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)
- Approximations for the Steiner multicycle problem (Q6109004) (← links)
- Existence of 2-factors in tough graphs without forbidden subgraphs (Q6172313) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
- The complexity of matching games: a survey (Q6488787) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
- Complexity of conformant election manipulation (Q6546592) (← links)
- Diverse pairs of matchings (Q6547215) (← links)
- The no-meet matroid (Q6558676) (← links)
- Approximations for the Steiner multicycle problem (Q6634374) (← links)
- Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)
- Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)
