Pages that link to "Item:Q819831"

The following pages link to Minimal separators in \(P_4\)-sparse graphs (Q819831):

Displaying 7 items.

• Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
• On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
• Minimal separators in \(P_4\)-tidy graphs (Q2840517) (← links)
• Some results on connected vertex separators (Q6040587) (← links)