The following pages link to (Q5678892):
Displaying 13 items.
- Unique factorization of compositive hereditary graph properties (Q270251) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- On probe permutation graphs (Q967305) (← links)
- On the X-join decomposition for undirected graphs (Q1142232) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Compositions for perfect graphs (Q2266722) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
