15,078 research outputs found

    Thomassen's Choosability Argument Revisited

    Full text link
    Thomassen (1994) proved that every planar graph is 5-choosable. This result was generalised by {\v{S}}krekovski (1998) and He et al. (2008), who proved that every K5K_5-minor-free graph is 5-choosable. Both proofs rely on the characterisation of K5K_5-minor-free graphs due to Wagner (1937). This paper proves the same result without using Wagner's structure theorem or even planar embeddings. Given that there is no structure theorem for graphs with no K6K_6-minor, we argue that this proof suggests a possible approach for attacking the Hadwiger Conjecture

    On grounded L-graphs and their relatives

    Get PDF
    We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. We also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions.Comment: 16 pages, 6 figure

    The Complexity of Change

    Full text link
    Many combinatorial problems can be formulated as "Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?". An example of such a question is: given two k-colourings of a graph, can I transform the first k-colouring into the second one, by recolouring one vertex at a time, and always maintaining a proper k-colouring? Another example is: given two solutions of a SAT-instance, can I transform the first solution into the second one, by changing the truth value one variable at a time, and always maintaining a solution of the SAT-instance? Other examples can be found in many classical puzzles, such as the 15-Puzzle and Rubik's Cube. In this survey we shall give an overview of some older and more recent work on this type of problem. The emphasis will be on the computational complexity of the problems: how hard is it to decide if a certain transformation is possible or not?Comment: 28 pages, 6 figure

    From planar surfaces based on lattices to freeform surfaces based on triangular meshes: an advanced extension of the areal motif method

    Get PDF
    Surfaces are shifting from traditional planar surfaces to freeform surfaces with significantly reduced volume and weight and highly improved performance. The areal motif method is used to analyse the topographical features on planar surfaces which are important to surface function. However the areal motif analysis cannot be directly applied to freeform surfaces, usually described by the triangular mesh data structure. To overcome this obstacle, a feasible strategy is proposed to extend the motif method. Morphological operations are employed to separate the “texture” and “form” surface. The watershed segmentation is then applied to the “texture” height surface in which the connection of each vertex is defined by the triangular mesh. The tiny motif due to the over-segmentation is combined by pruning the peaks and pits in the Pfaltz graph

    Proper circular arc graphs as intersection graphs of paths on a grid

    Full text link
    In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn)
    • …
    corecore