The following pages link to TWO THEOREMS IN GRAPH THEORY (Q3258697):
Displaying 50 items.
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- Converting triangulations to quadrangulations (Q1384213) (← links)
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time (Q1384532) (← links)
- A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs (Q1394096) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time (Q1747105) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- Stabilizing network bargaining games by blocking players (Q1801001) (← links)
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- ``Global'' graph problems tend to be intractable (Q1820581) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- On some algorithmic investigations of star partitions of graphs (Q1900141) (← links)
- Finding a maximum matching in a permutation graph (Q1902306) (← links)
- Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
- Complete subgraphs of the coprime hypergraph of integers. III: Construction (Q2010414) (← links)
- Condensed Ricci curvature of complete and strongly regular graphs (Q2036660) (← links)
- A condition on Hamilton-connected line graphs (Q2117573) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Some results on Berge's conjecture and begin-end conjecture (Q2145686) (← links)
- Independence and matching numbers of unicyclic graphs from null space (Q2176213) (← links)
- Allocating costs in set covering problems (Q2178140) (← links)
- Fair-by-design matching (Q2212506) (← links)
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities (Q2229485) (← links)
- Matching and spanning trails in digraphs (Q2231788) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Recomputing causality assignments on lumped process models when adding new simplification assumptions (Q2331813) (← links)
- Priority matchings revisited (Q2345219) (← links)
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (Q2364488) (← links)
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (Q2370435) (← links)
- Erdős-Ko-Rado for perfect matchings (Q2400976) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q2413142) (← links)
- Bipartite matching in the semi-streaming model (Q2429353) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
- A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908) (← links)
- Maximum fractional factors in graphs (Q2472791) (← links)
- Augmenting chains in graphs without a skew star. (Q2490836) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- Berge's theorem for the maximum charge problem (Q2506824) (← links)
- Heuristically guided search and chromosome matching (Q2542412) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- On an interpolation property of outerplanar graphs (Q2581566) (← links)
- Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
- Supereulerian graphs with constraints on the matching number and minimum degree (Q2657064) (← links)
