The following pages link to (Q3743346):
Displaying 20 items.
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- Independent domination in hereditary classes (Q818132) (← links)
- Pseudodomishold graphs (Q912871) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- A forbidden subgraph characterization of line-polar bipartite graphs (Q968193) (← links)
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs (Q1084418) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Recognition of unipolar and generalised split graphs (Q1736638) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Bipartite bihypergraphs: a survey and new results (Q2495517) (← links)
- Tripartite graphs with given degree set (Q2516853) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- Graphs and degree sequences. I (Q3803156) (← links)
- (Q4691790) (← links)
- Residual reliability of P-threshold graphs (Q4936504) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- A Generic Framework for Engineering Graph Canonization Algorithms (Q5232733) (← links)
