Pages that link to "Item:Q2568473"

The following pages link to The graphs with maximum induced matching and maximum matching the same size (Q2568473):

Displaying 32 items.

• On graphs with induced matching number almost equal to matching number (Q324703) (← links)
• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• Algebraic study on Cameron-Walker graphs (Q471882) (← links)
• Brambles and independent packings in chordal graphs (Q1045070) (← links)
• Degenerate matchings and edge colorings (Q1706114) (← links)
• An upper bound for the regularity of symbolic powers of edge ideals of chordal graphs (Q1740370) (← links)
• Approximating weighted induced matchings (Q1752475) (← links)
• Upper bounds for the regularity of powers of edge ideals of graphs (Q1998945) (← links)
• Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
• Regularity and \(a\)-invariant of Cameron-Walker graphs (Q2035829) (← links)
• Matching numbers and dimension of edge ideals (Q2045372) (← links)
• Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
• A new view toward vertex decomposable graphs (Q2144504) (← links)
• Regularity of powers of edge ideals: from local properties to global bounds (Q2200860) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs (Q2283036) (← links)
• On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
• Regularity, matchings and Cameron-Walker graphs (Q2301245) (← links)
• Maximum induced matchings close to maximum matchings (Q2348267) (← links)
• On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
• Equality of distance packing numbers (Q2515579) (← links)
• Independent packings in structured graphs (Q2583122) (← links)
• Maximal independent sets and regularity of graphs (Q4958324) (← links)
• Symbolic powers of vertex cover ideals (Q4970521) (← links)
• Homological invariants of Cameron–Walker Graphs (Q5009316) (← links)
• Regularity of symbolic powers of edge ideals of Cameron-Walker graphs (Q5124597) (← links)
• Coverings, Matchings and the number of maximal independent sets of graphs (Q5377038) (← links)
• Upper bounds for the regularity of symbolic powers of certain classes of edge ideals (Q5872574) (← links)
• Dominating induced matchings of finite graphs and regularity of edge ideals (Q5964813) (← links)
• On the Castelnuovo-Mumford regularity of squarefree powers of edge ideals (Q6057734) (← links)
• The regularity and h-polynomial of Cameron-Walker graphs (Q6098030) (← links)
• Gorenstein and Cohen–Macaulay matching complexes (Q6163890) (← links)