Pages that link to "Item:Q2717906"

The following pages link to Computing \(k\)-independent sets for regular bipartite graphs (Q2717906):

Displaying 10 items.

• Computing independent sets in graphs with large girth (Q1183338) (← links)
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
• Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
• Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
• Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095) (← links)
• On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
• Independence and irredundance in \(k\)-regular graphs (Q2713623) (← links)
• On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
• On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
• The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)