Pages that link to "Item:Q497363"

The following pages link to Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363):

Displaying 2 items.

• Critical and maximum independent sets of a graph (Q1671323) (← links)
• Two more characterizations of König-Egerváry graphs (Q2403804) (← links)