Forbidden subgraph problem

Known as: Turan-type problem

In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G, find the maximal number of edges in an n-vertex…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2020

Stick graphs are the intersection graphs of vertical and horizontal segments in the plane whose bottom and respectively left…

2017

We introduce three types of extension of Gallai gra ph operator in to signed graphsGallai signed graph, product-Gallai signed…

2014

We consider the constrained graph alignment problem which has applications in biological network analysis studies. Given two…

2011

Interval p-graphs were introduced by Brown et al. in 2002 as a generalization of interval bigraphs [D.E. Brown, S.C. Flink and J…

2009

We present here characterizations of graphs whose semi total (point) graphs are outerplanar and k -minimally nonouterplanar ( k…

2009

A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with an interval associated to…

2005

When an edge is added to a graph, each of the parameters y, i, and yt may change. When the addition of any edge causes the…

2004

A FORBIDDEN SUBGRAPH CHARACTERIZATION PROBLEM AND A MINIMAL-ELEMENT SUBSET OF UNIVERSAL GRAPH CLASSES Michael David Barrus, Jr…

1994

We study set systems over the vertex set (or edge set) of some graph that are induced by special graph properties like clique…

1984