Results 181 to 190 of about 69,865 (208)

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 on Hamiltonian index

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

Stability for large forbidden subgraphs [PDF]

Journal of Graph Theory, 2009
AbstractIn this note we strengthen the stability theorem of Erdős and Simonovits. Write Kr(s1, …, sr) for the complete r‐partite graph with classes of sizes s1, …, sr and Tr(n) for the r‐partite Turán graph of order n. Our main result is:For all r≥2 and all sufficiently small c>0, ε>0, every graph G of sufficiently large order n with e(G)>(1−1/
exaly   +3 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.
Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu   +3 more
openaire   +2 more sources

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   +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   +3 more sources

A Pair of Forbidden Subgraphs and 2-Factors

Combinatorics, Probability and Computing, 2012
In this paper, we consider pairs of forbidden subgraphs that imply the existence of a 2-factor in a graph. Ford≥ 2, letdbe the set of connected graphs of minimum degree at leastd. LetF1andF2be connected graphs and letbe a set of connected graphs. Then {F1,F2} is said to be a forbidden pair forif every {F1,F2}-free graph inof sufficiently large order ...
Jun Fujisawa, Akira Saito
openaire   +3 more sources

Local Density in Graphs with Forbidden Subgraphs

Combinatorics, Probability and Computing, 2003
Let \(G\) be a graph of order \(n\). It is shown for every integer \(r \geq 2\), there is a constant \(c = c(r) < 1\) such that if \(c \leq \alpha \leq 1\) and every set of \(\alpha n\) vertices span more than \((r-1)/2r(2\alpha - 1)n^2\) edges, then \(G\) contains a \(K_{r+1}\).
Peter Keevash, Benny Sudakov
openaire   +2 more sources

Forbidden Induced Subgraphs for Perfect Matchings

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhiro Ota, Gabriel Sueiro
openaire   +1 more source

Forbidden subgraphs and the existence of a 2‐factor

Journal of Graph Theory, 2009
AbstractIn this paper, we consider forbidden subgraphs which force the existence of a 2‐factor. Let \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}${\cal G}$\end{document} be the class of connected graphs of minimum degree at least two and maximum degree at least three, and let \documentclass{article}\footskip=0pc\pagestyle{empty}\
Robert E. L. Aldred, Jun Fujisawa, Akira Saito   +2 more
openaire   +1 more source