Clique Graphs of Chordal and Path Graphs

DOI10.1137/S0895480191223191MaRDI QIDQ4296528zbMATH OpenDBLPWikidataFDO

Authors Claudson F. Bornstein, Jayme L. Szwarcfiter

Publication date 19 June 1994

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480191223191

zbMATH Keywords

treecharacterizationintersection graphpath graphpolynomial algorithmspanning treechordal graphclique graphexpanded tree

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Recommendations

• On the tree representation of chordal graphs
• scientific article; zbMATH DE number 4116559
• scientific article; zbMATH DE number 3912430
• Recognizing clique graphs of directed edge path graphs
• Characterizing clique graphs of chordal comparability graphs

Cited in

(24)

• Split clique graph complexity
• Recognizing clique graphs of directed edge path graphs
• Cage-amalgamation graphs, a common generalization of chordal and median graphs
• scientific article; zbMATH DE number 4116571 (Why is no real title available?)
• Characterization of classical graph classes by weighted clique graphs
• NP-completeness results for edge modification problems
• scientific article; zbMATH DE number 1539533 (Why is no real title available?)
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Edge clique graphs and some classes of chordal graphs
• Cube intersection concepts in median graphs
• The clique operator on cographs and serial graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The clique-separator graph for chordal graphs
• On minimal vertex separators of dually chordal graphs: properties and characterizations
• Dually chordal graphs
• Recognizing clique graphs of directed and rooted path graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The complexity of clique graph recognition
• Split clique graph complexity
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
• \(r\)-dominating cliques in graphs with hypertree structure
• On the tree representation of chordal graphs
• Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs
• Intersection graphs of maximal hypercubes

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)