Reduced clique graphs of chordal graphs

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

Juraj Stacho, Michel A. Habib

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 graphs; graph representation; asteroidal sets; reduced clique graphs; tree representations

Mathematics Subject Classification ID

05C05: Trees

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

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