Pages that link to "Item:Q741738"

The following pages link to Algorithms for unipolar and generalized split graphs (Q741738):

Displaying 10 items.

• Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
• Recognition of unipolar and generalised split graphs (Q1736638) (← links)
• Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
• Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
• Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
• Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs (Q2953402) (← links)
• Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs (Q3181045) (← links)
• Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
• On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
• On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)