scholarly journals Bounding Tree-Width via Contraction on the Projective Plane and Torus.

10.37236/2534 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Evan Morgan ◽  
Bogdan Oporowski

If $X$ is a collection of edges in a graph $G$, let $G/X$ denote the contraction of $X$. Following a question of Oxley and a conjecture of Oporowski, we prove that every projective planar graph $G$ admits an edge partition $\{X,Y\}$ such that $G/X$ and $G/Y$ have tree-width at most three. We prove that every toroidal graph $G$ admits an edge partition $\{X,Y\}$ such that $G/X$ and $G/Y$ have tree-width at most three and four, respectively.

10.37236/1779 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Michael O. Albertson ◽  
Glenn G. Chappell ◽  
H. A. Kierstead ◽  
André Kündgen ◽  
Radhika Ramamurthi

A proper coloring of the vertices of a graph is called a star coloring if every two color classes induce a star forest. Star colorings are a strengthening of acyclic colorings, i.e., proper colorings in which every two color classes induce a forest. We show that every acyclic $k$-coloring can be refined to a star coloring with at most $(2k^2-k)$ colors. Similarly, we prove that planar graphs have star colorings with at most 20 colors and we exhibit a planar graph which requires 10 colors. We prove several other structural and topological results for star colorings, such as: cubic graphs are $7$-colorable, and planar graphs of girth at least $7$ are $9$-colorable. We provide a short proof of the result of Fertin, Raspaud, and Reed that graphs with tree-width $t$ can be star colored with ${t+2\choose2}$ colors, and we show that this is best possible.


2013 ◽  
Vol 312 ◽  
pp. 745-748
Author(s):  
Mei Xu

In this paper we investigate the cycle base structure of 2-connected graphs on the projective plane and show the minimum cycle bases of 2-connected outer planar graph G in the case of ew (G) 5. Then give a proof about the one-one property between the minimum cycle bases and the shortest no contractible cycles.


2011 ◽  
Vol Vol. 13 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Alexander Grigoriev

Graphs and Algorithms International audience We show that for a planar graph with no g-grid minor there exists a tree-decomposition of width at most 5g - 6. The proof is constructive and simple. The underlying algorithm for the tree-decomposition runs in O(n(2) log n) time.


Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.


Author(s):  
Hanjo Berressem

Providing a comprehensive reading of Deleuzian philosophy, Gilles Deleuze’s Luminous Philosophy argues that this philosophy’s most consistent conceptual spine and figure of thought is its inherent luminism. When Deleuze notes in Cinema 1 that ‘the plane of immanence is entirely made up of light’, he ties this philosophical luminism directly to the notion of the complementarity of the photon in its aspects of both particle and wave. Engaging, in chronological order, the whole body and range of Deleuze’s and Deleuze and Guattari’s writing, the book traces the ‘line of light’ that runs through Deleuze’s work, and it considers the implications of Deleuze’s luminism for the fields of literary studies, historical studies, the visual arts and cinema studies. It contours Deleuze’s luminism both against recent studies that promote a ‘dark Deleuze’ and against the prevalent view that Deleuzian philosophy is a philosophy of difference. Instead, it argues, it is a philosophy of the complementarity of difference and diversity, considered as two reciprocally determining fields that are, in Deleuze’s view, formally distinct but ontologically one. The book, which is the companion volume toFélix Guattari’s Schizoanalytic Ecology, argues that the ‘real projective plane’ is the ‘surface of thought’ of Deleuze’s philosophical luminism.


2018 ◽  
Vol 341 (8) ◽  
pp. 2121-2130 ◽  
Author(s):  
Gábor Korchmáros ◽  
Gábor P. Nagy
Keyword(s):  

2021 ◽  
Vol 95 ◽  
pp. 103319
Author(s):  
Zdeněk Dvořák ◽  
Carl Feghali
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document