Results 121 to 130 of about 9,740 (155)

On Universal Graphs With Forbidden Topological Subgraphs

European Journal of Combinatorics, 1985
A graph \(G^*\) is called universal in a class \(\bar G\) of countable graphs if it contains a copy of every G in \(\bar G.\) The graph \(G^*\) is called strongly universal if every G in \(\bar G\) is isomorphic to an induced subgraph of \(G^*\). For each pair n and m of positive integers, let \(\bar G(\)n,m) represent the class of all countable graphs
openaire   +2 more sources

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs

Informatika, 2018
A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj  

Forbidden subgraphs in terms of forbidden quantifiers.

Notre Dame Journal of Formal Logic, 1978
openaire   +3 more sources

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 L. Cherlin, Niandong Shi
openaire   +2 more sources

Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes

Journal of Graph Theory, 1999
Given an ordered graph \((G,
exaly   +3 more sources

Forbidden subgraphs on Hamiltonian index

Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xia Liu, Liming Xiong
openaire   +1 more source

Implications in rainbow forbidden subgraphs

Discrete Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Cui, Qinghai Liu, Colton Magnant, Akira Saito   +3 more
openaire   +1 more source

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.
Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu   +3 more
openaire   +1 more source

Forbidden induced subgraphs for toughness

J. Graph Theory, 2013
Summary: Let \(\mathcal F\) be a family of connected graphs. A graph \(G\) is said to be \(\mathcal F\)-free if \(G\) is \(H\)-free for every graph \(H\) in \(\mathcal F\). 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
Katsuhiro Ota, Gabriel Sueiro
openaire   +1 more source

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