Pages that link to "Item:Q4296528"
From MaRDI portal
The following pages link to Clique Graphs of Chordal and Path Graphs (Q4296528):
Displayed 16 items.
- Split clique graph complexity (Q393107) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← 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)
- Dually chordal graphs (Q6143980) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)