Results 191 to 200 of about 772 (221)
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.
Cherlin, Gregory, Shi, Niandong
openaire +2 more sources
Forbidden subgraphs on Hamiltonian index
Discrete Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Xia, Xiong, Liming
openaire +1 more source
Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes
Journal of Graph Theory, 1999Given an ordered graph \((G,
openaire +2 more sources
Forbidden Induced Subgraphs for Perfect Matchings
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ota, Katsuhiro, Sueiro, Gabriel
openaire +1 more source
Implications in rainbow forbidden subgraphs
Discrete Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Cui +3 more
openaire +1 more source
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 +1 more source
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 +1 more source
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.
Genghua Fan +3 more
openaire +1 more source
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 +2 more sources