The following pages link to (Q5338785):
Displaying 41 items.
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- 4-factor-criticality of vertex-transitive graphs (Q726659) (← links)
- Minimal connected \(\tau\)-critical hypergraphs (Q855295) (← links)
- Large matchings from eigenvalues (Q869943) (← links)
- Matchings in regular graphs from eigenvalues (Q1003830) (← links)
- Critical hypergraphs and interesting set-pair systems (Q1071788) (← links)
- t-expansive and t-wise intersecting hypergraphs (Q1076693) (← links)
- Graph factors (Q1168989) (← links)
- A short proof that matching matroids are transversal (Q1186958) (← links)
- Inequalities for minimal covering sets in set systems of given rank (Q1329820) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Spanning subgraphs with specified valencies (Q1844690) (← links)
- A generalisation of matching and colouring (Q1877669) (← links)
- Largest 2-regular subgraphs in 3-regular graphs (Q2000571) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← links)
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- Irreducible decomposition of powers of edge ideals (Q2178508) (← links)
- Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity (Q2191262) (← links)
- On the König deficiency of zero-reducible graphs (Q2292142) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- Critical paired dominating sets and irreducible decompositions of powers of edge ideals (Q2328153) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- Spanning subgraphs with specified valencies. (Reprint) (Q2497993) (← links)
- Factor-critical graphs with the minimum number of near-perfect matchings (Q2515569) (← links)
- Perfect matchings of a graph (Q2531805) (← links)
- Extremal graphs for blow-ups of keyrings (Q2657053) (← links)
- Extremal graphs for edge blow-up of graphs (Q2664560) (← links)
- 3-Factor-Criticality of Vertex-Transitive Graphs (Q2800542) (← links)
- A hypergraph version of the Gallai-Edmonds Theorem (Q3439610) (← links)
- (Q3875973) (← links)
- Associated primes of powers of edge ideals and ear decompositions of graphs (Q5227983) (← links)
- Matching criticality in intersecting hypergraphs (Q5236049) (← links)
- On Ramsey minimal graphs (Q5917560) (← links)
- Minimally \(k\)-factor-critical graphs for some large \(k\) (Q6115428) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
- Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs (Q6615460) (← links)
- A unified combinatorial view beyond some spectral properties (Q6635841) (← links)
