Results 291 to 300 of about 8,313 (308)

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

Component factors and induced subgraphs

Journal of Graph Theory, 1996
Let \(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, 2009
An 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, József Balogh, Alexandr V. Kostochka, Wojciech Samotij   +3 more
openaire   +1 more source

Extendable graphs and induced subgraphs

SUT Journal of Mathematics (Formerly TRU Mathematics), 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Excluding induced subgraphs

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

The path minimises the average size of a connected induced subgraph

Discrete Mathematics, 2022
John Haslegrave
exaly  

Mapping Induced Subgraph Isomorphism Problems to Ising Models and Its Evaluations by an Ising Machine

IEICE Transactions on Information and Systems, 2021
Masashi Tawada, Shu Tanaka, Satoshi Yagi   +2 more
exaly  

Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems

IEICE Transactions on Information and Systems, 2013
Yuichi Asahiro, Eiji Miyano
exaly  

Induced Subgraph in Random Regular Graph

Journal of Systems Science and Complexity, 2008
Guiying Yan, Yan Guiying
exaly  

Parameterized complexity of the induced subgraph problem in directed graphs

Information Processing Letters, 2007
Venkaṭesh Raman, Somnath Sikdar
exaly