Pages that link to "Item:Q2032704"

The following pages link to Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704):

Displaying 9 items.

• A generalization of an independent set with application to \((K_q; k)\)-stable graphs (Q741777) (← links)
• Maximizing the number of independent sets of fixed size in connected graphs with given independence number (Q1684927) (← links)
• Extremal colorings and independent sets (Q1756103) (← links)
• \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs (Q1974533) (← links)
• Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
• Independent \([1,k]\)-sets in graphs (Q2876034) (← links)
• (Q3141602) (← links)
• Extremal problems for connected set enumeration (Q6094711) (← links)
• Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs (Q6660051) (← links)