Pages that link to "Item:Q1026133"

The following pages link to The clique-separator graph for chordal graphs (Q1026133):

Displaying 20 items.

• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
• Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
• Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
• Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
• Resource allocation with time intervals (Q606987) (← links)
• On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\) (Q1618244) (← links)
• A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
• Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
• Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
• An efficient representation of chordal graphs (Q2450661) (← links)
• Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
• An efficient algorithm for counting Markov equivalent DAGs (Q2667829) (← links)
• A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION (Q2841986) (← links)
• Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
• Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
• (Q5136273) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)