Pages that link to "Item:Q4296528"

The following pages link to Clique Graphs of Chordal and Path Graphs (Q4296528):

Displaying 22 items.

• Split clique graph complexity (Q393107) (← links)
• The complexity of clique graph recognition (Q1019185) (← links)
• Cage-amalgamation graphs, a common generalization of chordal and median graphs (Q1024305) (← links)
• Cube intersection concepts in median graphs (Q1025912) (← links)
• The clique-separator graph for chordal graphs (Q1026133) (← links)
• Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
• \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
• On minimal vertex separators of dually chordal graphs: properties and characterizations (Q1759837) (← links)
• The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
• The clique operator on cographs and serial graphs (Q1827743) (← links)
• Recognizing clique graphs of directed edge path graphs (Q1861580) (← links)
• Intersection graphs of maximal hypercubes (Q1867285) (← links)
• Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
• NP-completeness results for edge modification problems (Q2500532) (← links)
• Split Clique Graph Complexity (Q3104760) (← links)
• (Q4519720) (← links)
• (Q4731206) (← links)
• Edge clique graphs and some classes of chordal graphs (Q5957745) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
• Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs'' (Q6540643) (← links)
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)