Results 241 to 250 of about 5,057 (262)
Some of the next articles are maybe not open access.
Forbidden induced subgraphs for toughness
J. Graph Theory, 2013Summary: 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
Component factors and induced subgraphs
Journal of Graph Theory, 1996Let \(G\) and \(K\) be connected graphs for the orders of which that \(|G|=n|K|\) \((n\geq2)\) holds and let \(p\) be a fixed integer satisfying ...
openaire +2 more sources
Sizes of Induced Subgraphs of Ramsey Graphs
Combinatorics, Probability and Computing, 2009An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs, any two of which differ either in the number of vertices or in the number of edges, i.e., the number of distinct ...
Noga Alon +3 more
openaire +1 more source
Extendable graphs and induced subgraphs
SUT Journal of Mathematics (Formerly TRU Mathematics), 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2007
In this paper we survey some results concerning the structure and properties of families of graphs defined by excluding certain induced subgraphs, including perfect graphs, claw-free graphs, even-hole-free graphs and others.
Maria Chudnovsky, Paul Seymour
openaire +1 more source
In this paper we survey some results concerning the structure and properties of families of graphs defined by excluding certain induced subgraphs, including perfect graphs, claw-free graphs, even-hole-free graphs and others.
Maria Chudnovsky, Paul Seymour
openaire +1 more source
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
Journal of Graph Theory, 2023Karl Heuer, Deniz Sarikaya
exaly
Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
Quaestiones Mathematicae, 2022Eric Ould Dadah Andriantiana +1 more
exaly
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
Journal of Graph Theory, 2021Maria Axenovich, Casey Tompkins
exaly

