The following pages link to (Q3258698):
Displaying 50 items.
- Some extremal graphs with respect to inverse degree (Q260055) (← links)
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Spectral radius and fractional matchings in graphs (Q268270) (← links)
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- Some extremal results on the connective eccentricity index of graphs (Q499166) (← links)
- On saturation games (Q499485) (← links)
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs (Q503616) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Generalization of matching extensions in graphs. III (Q534332) (← links)
- Matchings in benzene chains (Q594902) (← links)
- Claw-free graphs. VI: Colouring (Q602712) (← links)
- Smallest close to regular bipartite graphs without an almost perfect matching (Q606288) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles (Q668084) (← links)
- Spanning closed trails in graphs (Q686147) (← links)
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number (Q739130) (← links)
- On the relationship between the genus and the cardinality of the maximum matchings of a graph (Q755593) (← links)
- Note on matching preclusion number of random graphs (Q784472) (← links)
- Matchings in pentagonal chains (Q791538) (← links)
- Spectral radius of graphs with given matching number (Q869922) (← links)
- Large matchings from eigenvalues (Q869943) (← links)
- Saturation numbers for linear forests \(P_5\cup tP_2\) (Q897277) (← links)
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
- Location-domination and matching in cubic graphs (Q906465) (← links)
- The difference and ratio of the fractional matching number and the matching number of graphs (Q906487) (← links)
- A note on parity constrained orientations (Q987565) (← links)
- Matchings in regular graphs from eigenvalues (Q1003830) (← links)
- Conditional matching preclusion sets (Q1006754) (← links)
- Bounds on maximum \(b\)-matchings (Q1043589) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Short proofs on the matching polyhedron (Q1050377) (← links)
- Stirling numbers and records (Q1053046) (← links)
- The Edmonds-Gallai decomposition for matchings in locally finite graphs (Q1053712) (← links)
- On the chromatic number of certain highly symmetric graphs (Q1062067) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Lower bounds on the cardinality of the maximum matchings of planar graphs (Q1135291) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- f-factors and related decompositions of graphs (Q1147717) (← links)
- Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2 (Q1147718) (← links)
- On generalized matching problems (Q1149783) (← links)
- A new linear programming algorithm - better or worse than the simplex method? (Q1153837) (← links)
- On the maximum matchings of regular multigraphs (Q1155632) (← links)
- Indestructive deletions of edges from graphs (Q1164646) (← links)
- Maximum \((g,f)\)-factors of a general graph (Q1179272) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
