Results 201 to 210 of about 10,864 (212)

Coloring Graphs With Forbidden Almost Bipartite Subgraphs

James Anderson, Anton Bernshteyn, Abhishek Dhawan   +2 more
openalex   +1 more source

Forbidden subgraphs of TI-power graphs of finite groups

Huani Li, Jin Chen, Shixun Lin
openalex   +1 more source

Risk Index of Regional Infection Expansion of COVID-19: Moving Direction Entropy Study Using Mobility Data and Its Application to Tokyo.

JMIR Public Health Surveill
Ohsawa Y, Sun Y, Sekiguchi K, Kondo S, Maekawa T, Takita M, Tanimoto T, Kami M.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Forbidden subgraphs and forbidden substructures

Journal of Symbolic Logic, 2001
AbstractThe 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   +2 more sources

Implications in rainbow forbidden subgraphs

Discrete Mathematics, 2021
Abstract 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, Qinghai Liu, Colton Magnant, Akira Saito   +3 more
openaire   +2 more sources

Forbidden Induced Subgraphs for Toughness

Journal of Graph Theory, 2012
Let 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

Forbidden Subgraphs and 3-Colorings

SIAM Journal on Discrete Mathematics, 2014
A 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, Genghua Fan, Tianjun Ye, Xingxing Yu   +3 more
openaire   +2 more sources

Forbidden Ordered Subgraphs

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

Forbidden subgraphs and graph decomposition

Networks, 1987
AbstractSeries‐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