Pages that link to "Item:Q1142232"

The following pages link to On the X-join decomposition for undirected graphs (Q1142232):

Displaying 22 items.

• Interval decomposition lattices are balanced (Q305165) (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• A distance measure for large graphs based on prime graphs (Q531270) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• Graph classes with and without powers of bounded clique-width (Q896650) (← links)
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
• On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
• On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
• \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
• Modular decomposition and transitive orientation (Q1301738) (← links)
• A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
• Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
• A linear algorithm to decompose inheritance graphs into modules (Q1892582) (← links)
• An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
• Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
• Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
• Decomposition of Directed Graphs (Q3960725) (← links)
• (Q4691867) (← links)
• Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)