You are currently offline. Some features of the site may not work correctly.

# Chordal completion

In graph theory, a branch of mathematics, a chordal completion of a given undirected graph G is a chordal graph on the same vertex set that has G as… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• Oper. Res.
• 2019
• Corpus ID: 16020190
A graph is chordal if every cycle of length at least four contains a chord—that is, an edge connecting two nonconsecutive… Expand
Is this relevant?
2018
2018
• 2018
• Corpus ID: 119136810
In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality \$\omega(G^*) - \omega(G… Expand
Is this relevant?
2018
2018
• 2018
• Corpus ID: 53653052
In this paper, we present a minimal chordal completion G∗ of a graphG satisfying the inequality ω(G∗)−ω(G) ≤ i(G) for the non… Expand
Is this relevant?
2016
2016
• Ann. Pure Appl. Log.
• 2016
• Corpus ID: 2299949
Abstract We present new parameterized preservation properties that provide for each natural number k, semantic characterizations… Expand
Is this relevant?
2015
2015
• Algorithmica
• 2015
• Corpus ID: 2148030
Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property… Expand
Is this relevant?
2015
2015
• CPAIOR
• 2015
• Corpus ID: 14063122
This paper introduces an integer programming approach to the minimum chordal completion problem. This combinatorial optimization… Expand
Is this relevant?
2013
2013
• Theor. Comput. Sci.
• 2013
• Corpus ID: 205346848
An interval completion of an arbitrary graph G is an interval graph H, on the same vertex set, obtained from G by adding new… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
• Discret. Appl. Math.
• 1997
• Corpus ID: 35936804
Abstract We introduce the separator graph for a given graph G and show a 1-1 correspondence between its maximal cliques and the… Expand
Is this relevant?
1994
1994
• J. Comb. Theory, Ser. B
• 1994
• Corpus ID: 6497021
We prove that every planar graph on n vertices is contained in a chordal graph with at most cn log n edges for some abolsute… Expand
Is this relevant?