Reduced clique graphs of chordal graphs
From MaRDI portal
Publication:412263
DOI10.1016/J.EJC.2011.09.031zbMATH Open1237.05139OpenAlexW2100478405MaRDI QIDQ412263FDOQ412263
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
Cites Work
- Title not available (Why is that?)
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Characterizing path graphs by forbidden induced subgraphs
- On the tree representation of chordal graphs
- Decomposition of Directed Graphs
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- Independent Sets in Asteroidal Triple-Free Graphs
- A characterisation of rigid circuit graphs
- On some simplicial elimination schemes for chordal graphs
- A decomposition theorem for chordal graphs and its applications
- Minimal weak separators of chordal graphs.
- Generating the maximum spanning trees of a weighted graph
- An O(n2) Algorithm for Undirected Split Decomposition
- Approximating Bandwidth by Mixing Layouts of Interval Graphs
- Enumeration of the perfect sequences of a chordal graph
- Branchwidth of chordal graphs
Cited In (15)
- A new characterization of \(k\)-trees and some applications
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- Characterization of classical graph classes by weighted clique graphs
- On \(H\)-topological intersection graphs
- On basic chordal graphs and some of its subclasses
- An efficient representation of chordal graphs
- Non-inclusion and other subclasses of chordal graphs
- Clique representations and dimension-\(k\) chordal graphs
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- On the correspondence between tree representations of chordal and dually chordal graphs
- Clique tree generalization and new subclasses of chordal graphs
- Comparing trees characteristic to chordal and dually chordal graphs
- New results on Ptolemaic graphs
- COSMO: a conic operator splitting method for convex conic problems
- Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs
This page was built for publication: Reduced clique graphs of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412263)
