Results 61 to 70 of about 30,213,529 (145)
The Book Thickness of 1-Planar Graphs is Constant [PDF]
Algorithmica, 2016 In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges on the same page do not cross. In this paper, we prove that every $1$-planar graph (that is, a graph that can be drawn on the plane such that no edge is crossed more than once) admits an embedding in a book with constant ...
Michael A. Bekos +3 more
openaire +4 more sources
Negative results on acyclic improper colorings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number $k$ is at most $k2^{k-1}$. We prove that this bound is tight for $k \geq 3$.
Pascal Ochem
doaj +1 more source
1-planarity of complete multipartite graphs
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Július Czap, Dávid Hudák
openaire +3 more sources
The complexity of two graph orientation problems [PDF]
, 2012 This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, Steven D. +7 more
core +1 more source
Journal of Computational Geometry, 2022 Morphing geometric graphs is a classical problem in graph theory and computational geometry with seminal results established by Cairns in 1944 [Amer. Math. Monthly, 51] and by Thomassen in 1983 [J. of Comb. Theor., Series B, 34].
Patrizio Angelini +3 more
doaj +1 more source
On properties of maximal 1-planar graphs
Discussiones Mathematicae Graph Theory, 2012 Department of Mathematics, Faculty of ScienceNiigata University8050, Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japane-mail: y-suzuki@math.sc.niigata-u.ac.jpAbstractA graph is called 1-planar if there exists a drawing in the plane so thateach edge contains at most one crossing.
Dávid Hudák +2 more
openaire +1 more source
Stack and Queue Layouts via Layered Separators
Journal of Graph Algorithms and Applications, 2018 It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not
Vida Dujmović, Fabrizio Frati
doaj +1 more source
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
Кібернетика та комп'ютерні технології, 2020 The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj +1 more source
Equitable coloring in 1-planar graphs
Discrete Mathematics9 ...
Daniel W. Cranston, Reem Mahmoud
openaire +2 more sources
On Alliance Partitions and Bisection Width for Planar Graphs
Journal of Graph Algorithms and Applications, 2013 An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show how to construct infinitely many non-trivial
Martin Olsen, Morten Revsbaek
doaj +1 more source