Reduced clique graphs of chordal graphs

DOI10.1016/j.ejc.2011.09.031zbMath1237.05139OpenAlexW2100478405MaRDI QIDQ412263

Michel A. Habib, Juraj Stacho

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.031

zbMATH Keywords

chordal graphsgraph representationasteroidal setsreduced clique graphstree representations

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

Computing the union join and subset graph of acyclic hypergraphs in subquadratic time ⋮ On basic chordal graphs and some of its subclasses ⋮ On the correspondence between tree representations of chordal and dually chordal graphs ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ An efficient representation of chordal graphs ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ New results on Ptolemaic graphs ⋮ Non-inclusion and other subclasses of chordal graphs ⋮ On \(H\)-topological intersection graphs ⋮ Comparing trees characteristic to chordal and dually chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Enumeration of the perfect sequences of a chordal graph
• Branchwidth of chordal graphs
• A characterisation of rigid circuit graphs
• Algorithmic graph theory and perfect graphs
• Incidence matrices and interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On some simplicial elimination schemes for chordal graphs
• A Decomposition Theorem for Chordal Graphs and its Applications
• Representation of a finite graph by a set of intervals on the real line
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• Characterizing path graphs by forbidden induced subgraphs
• Generating the maximum spanning trees of a weighted graph
• On the tree representation of chordal graphs
• Decomposition of Directed Graphs
• Independent Sets in Asteroidal Triple-Free Graphs
• An O(n2) Algorithm for Undirected Split Decomposition
• Approximating Bandwidth by Mixing Layouts of Interval Graphs

This page was built for publication: Reduced clique graphs of chordal graphs