Forbidden graph characterization

Known as: Forbidden minor, Forbidden minor characterization, Forbidden induced subgraph

In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphsthat do not belong…

Papers overview

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

2016

In the M aximum W eight I ndependent S et problem, the input is a graph G, every vertex has a nonnegative integer weight, and the…

2014

Operations for extending/embedding a smaller network into a larger network that preserve the insufficiency of classes of linear…

2011

If all proper factors of a word u are β-power-free while u itself is not, then u is a minimal β-power. We consider the following…

2010

We present a GAP package for computing with Schurian coherent configurations and their representations.

2009

2005

A planar graph is said to be trivializable if every regular projection of the graph produces a trivial spatial embedding by…

1997

In this thesis we study finite graphs and graph homomorphisms from both, a theoretical and a practical view point. A homomorphism…

1993

1991

1989