Pages that link to "Item:Q651036"

The following pages link to Longest cycles in \(k\)-connected graphs with given independence number (Q651036):

Displaying 12 items.

• Large degree vertices in longest cycles of graphs. I (Q274689) (← links)
• Highly connected subgraphs of graphs with given independence number (extended abstract) (Q510552) (← links)
• Longest cycles in 3-connected graphs with given independence number (Q1043819) (← links)
• On a conjecture of Bondy (Q1065023) (← links)
• Highly connected subgraphs of graphs with given independence number (Q1746581) (← links)
• Long cycles in triangle-free graphs with prescribed independence number and connectivity (Q1826952) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
• An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets (Q2354602) (← links)
• Intersections of cycles in \(k\)-connected graphs (Q2354605) (← links)
• On the Thomassen's conjecture (Q2746209) (← links)
• Circumferences of k-connected graphs involving independence numbers (Q3174236) (← links)