Skip to search formSkip to main contentSkip to account menu

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
A graph is chordal if every cycle of length at least four contains a chord—that is, an edge connecting two nonconsecutive… 
2019
2019
Recently, Creignou et al. (Theory Comput. Syst. 2017), introduced the class Delay FPT into parameterised complexity theory in… 
2018
2018
In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality $\omega(G^*) - \omega(G… 
2015
2015
This paper introduces an integer programming approach to the minimum chordal completion problem. This combinatorial optimization… 
Highly Cited
2014
Highly Cited
2014
Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property… 
Highly Cited
1997
Highly Cited
1997
1994
1994
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…