A characterization of internally 4-connected {;P_{10}-{;v_{1}, v_{2}} }-minor-free graphs
نویسندگان
چکیده
منابع مشابه
$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs
We prove that every connected graph G with m edges contains a set X of at most 3 16 (m+ 1) vertices such that G−X has no K4 minor, or equivalently, has treewidth at most 2. This bound is best possible and improves a recent bound of 19 100m+ 3 20 due to Edwards and Farr. Connectivity is essential: If G is not connected then only a bound of 15m can be guaranteed.
متن کاملInternally 4-connected projective-planar graphs
5 Archdeacon proved that projective-planar graphs are characterized by 35 excluded minors. 6 Using this result we show that internally 4-connected projective-planar graphs are characterized 7 by 23 internally 4-connected excluded minors. 8
متن کاملA Characterization of K2, 4-Minor-Free Graphs
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains K4 and, for each n ≥ 5, 2n − 8 nonisomorphic graphs of order n. To describe the 2-connected K2,4-minor-free graphs we use xy-outerplanar graphs, graphs embeddable in the pl...
متن کاملThe Characterization of planar, 4-connected, K_{2, 5}-minor-free graphs
We show that every planar, 4-connected, K2,5-minor-free graph is the square of a cycle of even length at least six.
متن کاملGenerating Internally Four-Connected Graphs
A graph is a minor of another if the first can be obtained from a subgraph of the second by contracting edges. A graph G is internally 4-connected if it is simple, 3-connected, has at least five vertices, and if for every partition (A, B) of the edge-set of G, either |A| ≤ 3, or |B| ≤ 3, or at least four vertices of G are incident with an edge in A and an edge in B. We prove that if H and G are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2021
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2404