Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,216,479 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.
2018
2018
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams
Jun Kawahara
,
Toshiki Saitoh
,
Hirofumi Suzuki
,
Ryo Yoshinaka
arXiv.org
2018
Corpus ID: 4775595
We propose a general method performed over multivalued decision diagrams that enumerates all subgraphs of an input graph that are…
Expand
2018
2018
Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs
Akash Kumar
,
C. Seshadhri
,
Andrew Stolman
arXiv.org
2018
Corpus ID: 195346573
2015
2015
Extending the MAX Algorithm for Maximum Independent Set
Christoph Brause
,
N. C. Lê
,
I. Schiermeyer
Discussiones Mathematicae Graph Theory
2015
Corpus ID: 9615503
Abstract The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a…
Expand
2013
2013
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
D. Meister
,
U. Rotics
arXiv.org
2013
Corpus ID: 9920504
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of…
Expand
2011
2011
Facets in the Crossing Number Polytope
Markus Chimani
SIAM Journal on Discrete Mathematics
2011
Corpus ID: 9509488
In the last years, several integer linear programming (ILP) formulations for the crossing number problem arose. While they all…
Expand
2006
2006
Forbidden Subgraphs and ( k , m )-pancyclicity
Charles B. Crane
2006
Corpus ID: 16929490
A graph G on n vertices is said to be (k, m)-pancyclic if each k-set S ⊆ V (G) is contained in cycles of each of the following…
Expand
2005
2005
Testing Orientation Properties
S. Halevy
,
Oded Lachish
,
Ilan Newman
,
Dekel Tsur
Electron. Colloquium Comput. Complex.
2005
Corpus ID: 17199390
We propose a new model for studying graph related problems that we call the orientation model. In this model, an undirected graph…
Expand
Review
2002
Review
2002
The obstructions of a minor-closed set of graphs defined by a context-free grammar 1
B. C. Le
2002
Corpus ID: 5325031
We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be…
Expand
1998
1998
A Forbidden Subdigraph Condition Implying An Oriented Graph To Be Hamiltonian
A. Kemnitz
,
Birte Greger
1998
Corpus ID: 18222302
In this note we prove that a strong oriented graph of order at least 3 without containing an induced subdigraph of a set of seven…
Expand
1991
1991
Graph reductions, and techniques for finding minimal forbidden minors
A. Proskurowski
Graph Structure Theory
1991
Corpus ID: 43309244