Pages that link to "Item:Q819831"

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

Displaying 5 items.

• 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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-tidy graphs (Q2840517) (← links)
• Some results on connected vertex separators (Q6040587) (← links)