Adding an Edge in a P_4-sparse Graph

01/31/2023
by   Anna Mpanti, et al.
0

The minimum completion (fill-in) problem is defined as follows: Given a graph family ℱ (more generally, a property Π) and a graph G, the completion problem asks for the minimum number of non-edges needed to be added to G so that the resulting graph belongs to the graph family ℱ (or has property Π). This problem is NP-complete for many subclasses of perfect graphs and polynomial solutions are available only for minimal completion sets. We study the minimum completion problem of a P_4-sparse graph G with an added edge. For any optimal solution of the problem, we prove that there is an optimal solution whose form is of one of a small number of possibilities. This along with the solution of the problem when the added edge connects two non-adjacent vertices of a spider or connects two vertices in different connected components of the graph enables us to present a polynomial-time algorithm for the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2021

On the proper interval completion problem within some chordal subclasses

Given a property (graph class) Π, a graph G, and an integer k, the Π-com...
research
04/14/2022

On restricted completions of chordal and trivially perfect graphs

Let G be a graph having a vertex v such that H = G - v is a trivially pe...
research
12/21/2019

Complexity results for the proper disconnection of graphs

For an edge-colored graph G, a set F of edges of G is called a proper ed...
research
02/01/2023

Adding a Tail in Classes of Perfect Graphs

Consider a graph G which belongs to a graph class C. We are interested i...
research
01/21/2020

Faster and Enhanced Inclusion-Minimal Cograph Completion

We design two incremental algorithms for computing an inclusion-minimal ...
research
09/18/2023

Graph Threading

Inspired by artistic practices such as beadwork and himmeli, we study th...
research
12/24/2018

Cops, robbers, and burning bridges

We consider a variant of Cops and Robbers wherein each edge traversed by...

Please sign up or login with your details

Forgot password? Click here to reset