Results 241 to 246 of about 59,275 (246)

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

Matroids Induced by Packing Subgraphs

SIAM Journal on Discrete Mathematics, 2004
Summary: This paper is concerned with the classification of families of graphs \(\mathcal T\) with the following property: For any graph \(G\), the subsets of vertices of \(G\) that can be saturated by packing copies of graphs from \(\mathcal T\) form a collection of independent sets of a matroid.
openaire   +3 more sources

Factors and Connected Induced Subgraphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

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   +3 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.
Paul Seymour, Maria Chudnovsky
openaire   +2 more sources

Cuts and Induced Bipartite Subgraphs

2017
In this chapter we compare three popular models for the maximum cut problem and show the equivalence of their relaxations by using compact extended formulations. These problems are closely related to the subject of edge-induced and node-induced bipartite subgraphs, for which we give compact extended formulations as well.
Lancia G., Serafini P.
openaire   +3 more sources