Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,318 papers from all fields of science
Search
Sign In
Create Free Account
Forbidden graph characterization
Known as:
Forbidden minor
, Forbidden minor characterization
, Forbidden induced subgraph
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
1-planar graph
Algorithm
Apex graph
Apollonian network
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Network embedding operations preserving the insufficiency of linear network codes
Congduan Li
,
S. Weber
,
J. Walsh
Allerton Conference on Communication, Control…
2014
Corpus ID: 11235161
Operations for extending/embedding a smaller network into a larger network that preserve the insufficiency of classes of linear…
Expand
2014
2014
A Dichotomy for Upper Domination in Monogenic Classes
Hassan AbouEisha
,
Shahid Hussain
,
V. Lozin
,
J. Monnot
,
B. Ries
International Conference on Combinatorial…
2014
Corpus ID: 22460687
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The…
Expand
2014
2014
The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
M. Dmitriy
2014
Corpus ID: 55564179
We obtain a complete complexity dichotomy for the edge 3colorability within the family of hereditary classes defined by forbidden…
Expand
2011
2011
On the existence of Minimal β-powers
A. Shur
International Journal of Foundations of Computer…
2011
Corpus ID: 6991663
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…
Expand
2005
2005
Newly found forbidden graphs for trivializability
Ryo Nikkuni
,
M. Ozawa
,
Kouki Taniyama
,
Y. Tsutsumi
2005
Corpus ID: 58896797
A planar graph is said to be trivializable if every regular projection of the graph produces a trivial spatial embedding by…
Expand
1997
1997
Structure of Graph Homomorphisms
Roman Bacik
1997
Corpus ID: 122512747
In this thesis we study finite graphs and graph homomorphisms from both, a theoretical and a practical view point. A homomorphism…
Expand
1996
1996
On Winning Strategies with Unary Quantifiers
Juha Nurmonen
Journal of Logic and Computation
1996
Corpus ID: 18103934
A combinatorial argument for two nite structures to agree on all sentences with bounded quantiier rank in rst-order logic with…
Expand
1993
1993
Which Claw-Free Graphs are Perfectly Orderable?
V. Chvátal
Discrete Applied Mathematics
1993
Corpus ID: 42504590
1991
1991
Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path - Width
高橋 篤司
,
上野 修一
,
梶谷 洋司
1991
Corpus ID: 124893872
1989
1989
Connected sequential colorings
A. Hertz
,
D. Werra
Discrete Mathematics
1989
Corpus ID: 21017777
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE