Pages that link to "Item:Q1949755"

The following pages link to Maximum matching in regular and almost regular graphs (Q1949755):

Displaying 30 items.

• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
• Matching and edge-connectivity in regular graphs (Q616391) (← links)
• On maximal matchings of connected graphs (Q812460) (← links)
• Maximum matchings in regular graphs of high girth (Q870087) (← links)
• Maximum matchings in a class of random graphs (Q1093654) (← links)
• A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
• Characterizations of maximum matching graphs of certain types (Q1772424) (← links)
• Finding a maximum matching in a permutation graph (Q1902306) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• The power of linear-time data reduction for maximum matching (Q2211355) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
• Regularity, matchings and Cameron-Walker graphs (Q2301245) (← links)
• Combinatorial properties of Farey graphs (Q2333787) (← links)
• Second kind maximum matching graph (Q2439122) (← links)
• On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
• Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• Linear reductions of maximum matching (Q2768405) (← links)
• Results and open problems in matchings in regular graphs (Q3166916) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• Maximal matchings in graphs with large neighborhoods of independent vertices (Q4713005) (← links)
• (Q4729838) (← links)
• (Q5091230) (← links)
• The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
• (Q5289457) (← links)
• Maximum matchings in geometric intersection graphs (Q6050213) (← links)
• Perfect matchings in highly cyclically connected regular graphs (Q6057581) (← links)
• COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB (Q6158062) (← links)