6,842 research outputs found
Construction of planar 4-connected triangulations
In this article we describe a recursive structure for the class of 4-connected triangulations or - equivalently - cyclically 4-connected plane cubic graphs
Constructing internally 4-connected binary matroids
This is the post-print version of the Article - Copyright @ 2013 ElsevierIn an earlier paper, we proved that an internally 4-connected binary matroid with at least seven elements contains an internally 4-connected proper minor that is at most six elements smaller. We refine this result, by giving detailed descriptions of the operations required to produce the internally 4-connected minor. Each of these operations is top-down, in that it produces a smaller minor from the original. We also describe each as a bottom-up operation, constructing a larger matroid from the original, and we give necessary and su fficient conditions for each of these bottom-up moves to produce an internally 4-connected binary matroid. From this, we derive a constructive method for generating all internally 4-connected binary matroids.This study is supported by NSF IRFP Grant 0967050, the Marsden Fund, and the National Security Agency
Making triangulations 4-connected using flips
We show that any combinatorial triangulation on n vertices can be transformed
into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give
an example of an infinite family of triangulations that requires this many
flips to be made 4-connected, showing that our bound is tight. In addition, for
n >= 19, we improve the upper bound on the number of flips required to
transform any 4-connected triangulation into the canonical triangulation (the
triangulation with two dominant vertices), matching the known lower bound of 2n
- 15. Our results imply a new upper bound on the diameter of the flip graph of
5.2n - 33.6, improving on the previous best known bound of 6n - 30.Comment: 22 pages, 8 figures. Accepted to CGTA special issue for CCCG 2011.
Conference version available at
http://2011.cccg.ca/PDFschedule/papers/paper34.pd
A chain theorem for 4-connected matroids
For the abstract of this paper, please see the PDF file
Unavoidable Parallel Minors of 4-Connected Graphs
A parallel minor is obtained from a graph by any sequence of edge
contractions and parallel edge deletions. We prove that, for any positive
integer k, every internally 4-connected graph of sufficiently high order
contains a parallel minor isomorphic to a variation of K_{4,k} with a complete
graph on the vertices of degree k, the k-partition triple fan with a complete
graph on the vertices of degree k, the k-spoke double wheel, the k-spoke double
wheel with axle, the (2k+1)-rung Mobius zigzag ladder, the (2k)-rung zigzag
ladder, or K_k. We also find the unavoidable parallel minors of 1-, 2-, and
3-connected graphs.Comment: 12 pages, 3 figure
On factors of 4-connected claw-free graphs
We consider the existence of several different kinds of factors in 4-connected claw-free graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4-connected line graph is Hamiltonian, i.e. has a connected 2-factor. Conjecture 2 (Matthews and Sumner): Every 4-connected claw-free graph is hamiltonian. We first show that Conjecture 2 is true within the class of hourglass-free graphs, i.e. graphs that do not contain an induced subgraph isomorphic to two triangles meeting in exactly one vertex. Next we show that a weaker form of Conjecture 2 is true, in which the conclusion is replaced by the conclusion that there exists a connected spanning subgraph in which each vertex has degree two or four. Finally we show that Conjecture 1 and 2 are equivalent to seemingly weaker conjectures in which the conclusion is replaced by the conclusion that there exists a spanning subgraph consisting of a bounded number of paths. \u
- …