Graph minor

Known as: Minor-closed graph family, Minor (graph), Topological minor

In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting…

Papers overview

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

2016

The article is devoted to the analytical understanding of the problems in the field of realisation and protection of the rights…

Review

2015

Review

2015

espanolCada vez que tiene lugar un crimen ejecutado por menores se reabre y recrudece el debate en torno al sistema de justicia…

2013

According to the classical Erdős–Pósa theorem, given a positive integer k, every graph G either contains k vertex disjoint cycles…

2013

C � Abstract. A fully block recursive method for computing outer generalized inverses of given square matrix is introduced. The…

2008

This article examines the issues raised by the use of the Internet by minors and children. In addition to being an outstanding…

2006

Abstract.Spatial distribution of ant workers and, notably their aggregation/segregation behaviour, is a key-element of the colony…

2000

1996

1983

1956