Pages that link to "Item:Q1949755"

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

Displaying 12 items.

• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← 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)
• Combinatorial properties of Farey graphs (Q2333787) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• (Q5091230) (← links)
• The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
• COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB (Q6158062) (← links)