Clique Graphs of Chordal and Path Graphs
From MaRDI portal
Publication:4296528
Recommendations
Cited in
(24)- \(r\)-dominating cliques in graphs with hypertree structure
- scientific article; zbMATH DE number 4116571 (Why is no real title available?)
- Split clique graph complexity
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Recognizing clique graphs of directed edge path graphs
- Intersection graphs of maximal hypercubes
- On the tree representation of chordal graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- The complexity of clique graph recognition
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Characterization of classical graph classes by weighted clique graphs
- NP-completeness results for edge modification problems
- Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Recognizing clique graphs of directed and rooted path graphs
- The clique operator on cographs and serial graphs
- Dually chordal graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- scientific article; zbMATH DE number 1539533 (Why is no real title available?)
- Edge clique graphs and some classes of chordal graphs
- Cube intersection concepts in median graphs
- Split clique graph complexity
- The clique-separator graph for chordal graphs
- On minimal vertex separators of dually chordal graphs: properties and characterizations
This page was built for publication: Clique Graphs of Chordal and Path Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296528)