# 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…
Wikipedia (opens in a new tab)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• Operational Research
• 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…
2019
2019
• Algorithms
• 2019
• Corpus ID: 203106603
Recently, Creignou et al. (Theory Comput. Syst. 2017), introduced the class Delay FPT into parameterised complexity theory in…
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…
2015
2015
• Integration of AI and OR Techniques in Constraint…
• 2015
• Corpus ID: 14063122
This paper introduces an integer programming approach to the minimum chordal completion problem. This combinatorial optimization…
2014
2014
• Annals of Pure and Applied Logic
• 2014
• Corpus ID: 2299949
Highly Cited
2014
Highly Cited
2014
• Algorithmica
• 2014
• Corpus ID: 2148030
Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property…
2013
2013
• Theoretical Computer Science
• 2013
• Corpus ID: 205346848
2008
2008
• Theoretical Computer Science
• 2008
• Corpus ID: 2500971
Highly Cited
1997
Highly Cited
1997
• Discrete Applied Mathematics
• 1997
• Corpus ID: 35936804
1994
1994
• Journal of combinatorial theory. Series B (Print)
• 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…