Pages that link to "Item:Q998471"

The following pages link to The independence number in graphs of maximum degree three (Q998471):

Displaying 17 items.

• Independent sets and matchings in subcubic graphs (Q427833) (← links)
• An improved lower bound on the independence number of a graph (Q477342) (← links)
• Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
• On the third largest number of maximal independent sets of graphs (Q726518) (← links)
• Finding independent sets in \(K_4\)-free 4-regular connected graphs (Q1386480) (← links)
• Degree multiplicities and independent sets in \(K_ 4\)-free graphs (Q1815307) (← links)
• On the independence number of graphs with maximum degree 3 (Q1951559) (← links)
• Minimum \(k\)-path vertex cover (Q2275922) (← links)
• The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
• Bounded clique cover of some sparse graphs (Q2359963) (← links)
• A rough set method for the vertex cover problem in graph theory (Q2987912) (← links)
• Independence, odd girth, and average degree (Q3005112) (← links)
• On the Independence Number of Graphs with Maximum Degree 3 (Q3104780) (← links)
• (Q4387731) (← links)
• New bounds on the independence number of connected graphs (Q4554556) (← links)
• Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)