Pages that link to "Item:Q612969"

The following pages link to Linear programming and the worst-case analysis of greedy algorithms on cubic graphs (Q612969):

Displayed 8 items.

• Independent dominating sets in regular graphs (Q358646) ‎ (← links)
• A structural approach for independent domination of regular graphs (Q497353) ‎ (← links)
• Connected domination of regular graphs (Q1025488) ‎ (← links)
• On the independent domination number of regular graphs (Q1929752) ‎ (← links)
• Minimum maximal matchings in cubic graphs (Q2144321) ‎ (← links)
• Approximation hardness of edge dominating set problems (Q2369972) ‎ (← links)
• Minimum independent dominating sets of random cubic graphs (Q4803314) ‎ (← links)
• A tight bound for independent domination of cubic graphs without 4‐cycles (Q6094034) ‎ (← links)