1,189 research outputs found

    Vertex Splitting and Upper Embeddable Graphs

    Full text link
    The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak minor of G is also in G. Up to now, there are few results providing the necessary and sufficient conditions for characterizing upper embeddability of graphs. In this paper, we studied the relation between the vertex splitting operation and the upper embeddability of graphs; provided not only a necessary and sufficient condition for characterizing upper embeddability of graphs, but also a way to construct weak-minor-closed family of upper embeddable graphs from the bouquet of circles; extended a result in J: Graph Theory obtained by L. Nebesk{\P}y. In addition, the algorithm complex of determining the upper embeddability of a graph can be reduced much by the results obtained in this paper

    Distributed Dominating Set Approximations beyond Planar Graphs

    Full text link
    The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there has been much progress on computing local approximations on sparse graphs, and in particular planar graphs. In this paper we study distributed and deterministic MDS approximation algorithms for graph classes beyond planar graphs. In particular, we show that existing approximation bounds for planar graphs can be lifted to bounded genus graphs, and present (1) a local constant-time, constant-factor MDS approximation algorithm and (2) a local O(logn)\mathcal{O}(\log^*{n})-time approximation scheme. Our main technical contribution is a new analysis of a slightly modified variant of an existing algorithm by Lenzen et al. Interestingly, unlike existing proofs for planar graphs, our analysis does not rely on direct topological arguments.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0299

    Simultaneous Embeddability of Two Partitions

    Full text link
    We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region that contains exactly those points that belong to the elements in the block and that is bounded by a simple closed curve. We establish three main classes of simultaneous embeddability (weak, strong, and full embeddability) that differ by increasingly strict well-formedness conditions on how different block regions are allowed to intersect. We show that these simultaneous embeddability classes are closely related to different planarity concepts of hypergraphs. For each embeddability class we give a full characterization. We show that (i) every pair of partitions has a weak simultaneous embedding, (ii) it is NP-complete to decide the existence of a strong simultaneous embedding, and (iii) the existence of a full simultaneous embedding can be tested in linear time.Comment: 17 pages, 7 figures, extended version of a paper to appear at GD 201

    Triunduloids: Embedded constant mean curvature surfaces with three ends and genus zero

    Full text link
    In 1841, Delaunay constructed the embedded surfaces of revolution with constant mean curvature (CMC); these unduloids have genus zero and are now known to be the only embedded CMC surfaces with two ends and finite genus. Here, we construct the complete family of embedded CMC surfaces with three ends and genus zero; they are classified using their asymptotic necksizes. We work in a class slightly more general than embedded surfaces, namely immersed surfaces which bound an immersed three-manifold, as introduced by Alexandrov.Comment: LaTeX, 22 pages, 2 figures (8 ps files); full version of our announcement math.DG/9903101; final version (minor revisions) to appear in Crelle's J. reine angew. Mat

    Boxicity of graphs on surfaces

    Get PDF
    The boxicity of a graph G=(V,E)G=(V,E) is the least integer kk for which there exist kk interval graphs Gi=(V,Ei)G_i=(V,E_i), 1ik1 \le i \le k, such that E=E1...EkE=E_1 \cap ... \cap E_k. Scheinerman proved in 1984 that outerplanar graphs have boxicity at most two and Thomassen proved in 1986 that planar graphs have boxicity at most three. In this note we prove that the boxicity of toroidal graphs is at most 7, and that the boxicity of graphs embeddable in a surface Σ\Sigma of genus gg is at most 5g+35g+3. This result yields improved bounds on the dimension of the adjacency poset of graphs on surfaces.Comment: 9 pages, 2 figure

    Logical limit laws for minor-closed classes of graphs

    Get PDF
    Let G\mathcal G be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\em connected} graphs in G\mathcal G on nn vertices, and the convergence law in MSO holds if we draw uniformly at random from all graphs in G\mathcal G on nn vertices. We also prove analogues of these results for the class of graphs embeddable on a fixed surface, provided we restrict attention to first order logic (FO). Moreover, the limiting probability that a given FO sentence is satisfied is independent of the surface SS. We also prove that the closure of the set of limiting probabilities is always the finite union of at least two disjoint intervals, and that it is the same for FO and MSO. For the classes of forests and planar graphs we are able to determine the closure of the set of limiting probabilities precisely. For planar graphs it consists of exactly 108 intervals, each of length 5106\approx 5\cdot 10^{-6}. Finally, we analyse examples of non-addable classes where the behaviour is quite different. For instance, the zero-one law does not hold for the random caterpillar on nn vertices, even in FO.Comment: minor changes; accepted for publication by JCT
    corecore