Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Operations for extending/embedding a smaller network into a larger network that preserve the insufficiency of classes of linear… 
2014
2014
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The… 
2014
2014
We obtain a complete complexity dichotomy for the edge 3colorability within the family of hereditary classes defined by forbidden… 
2011
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… 
2005
2005
A planar graph is said to be trivializable if every regular projection of the graph produces a trivial spatial embedding by… 
1997
1997
In this thesis we study finite graphs and graph homomorphisms from both, a theoretical and a practical view point. A homomorphism… 
1996
1996
A combinatorial argument for two nite structures to agree on all sentences with bounded quantiier rank in rst-order logic with…