Results 221 to 230 of about 10,088 (246)
Some of the next articles are maybe not open access.
Forbidden subgraphs and forbidden substructures
Journal of Symbolic Logic, 2001AbstractThe problem of the existence of a universal structure omitting a finite set of forbidden substructures is reducible to the corresponding problem in the category of graphs with a vertex coloring by two colors. It is not known whether this problem reduces further to the category of ordinary graphs.
Gregory Cherlin, Niandong Shi
openaire +3 more sources
Forbidden Induced Subgraphs for Toughness
Journal of Graph Theory, 2012Let be a family of connected graphs. A graph G is said to be -free if G is H-free for every graph H in . We study the relation between forbidden subgraphs in a connected graph G and the resulting toughness of G. In particular, we consider the problem of characterizing the graph families such that every large enough connected -free graph is t-tough.
Katsuhiro Ota, Gabriel Sueiro
openaire +2 more sources
Implications in rainbow forbidden subgraphs
Discrete Mathematics, 2021Abstract An edge-colored graph G is rainbow if each edge receives a different color. For a connected graph H , G is rainbow H -free if G does not contain a rainbow subgraph which is isomorphic to H . By definition, if H ′ is a connected subgraph of H , every rainbow H ′ -free graph is ...
Qing Cui +3 more
openaire +2 more sources
Forbidden subgraphs and graph decomposition
Networks, 1987AbstractSeries‐parallel graphs, outerplanar graphs, and graphs whose polygon matroids are transversal have been characterized by forbidden subgraphs. Tutte introduced a graph decomposition for nonseparable graphs. The results of this paper relate the existence of the forbidden subgraphs to properties of the decomposition.
openaire +3 more sources
1990
There are many special classes of undirected graphs which occur permanently in the literature in several contexts. These classes are interesting for their structural properties, and they are motivated from applications.
openaire +2 more sources
There are many special classes of undirected graphs which occur permanently in the literature in several contexts. These classes are interesting for their structural properties, and they are motivated from applications.
openaire +2 more sources
Forbidden Subgraphs and 3-Colorings
SIAM Journal on Discrete Mathematics, 2014A graph $G$ is said to satisfy the Vizing bound if $\chi(G)\le \omega(G)+1$, where $\chi(G)$ and $\omega(G)$ denote the chromatic number and clique number of $G$, respectively. The class of graphs satisfying the Vizing bound is clearly $\chi$-bounded in the sense of Gyarfas.
Baogang Xu +3 more
openaire +2 more sources
Substituent Effects in Mechanochemical Allowed and Forbidden Cyclobutene Ring-Opening Reactions
Journal of the American Chemical Society, 2021Cameron L Brown +2 more
exaly