Results 11 to 20 of about 1,484,168 (305)
Planar Graphs as VPG-Graphs [PDF]
Summary: A graph is \(B_k\)-VPG when it has an intersection representation by paths in a rectangular grid with at most \(k\) bends (turns). It is known that all planar graphs are \(B_3\)-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are \(B_2\)-VPG.
Steven Chaplick, Torsten Ueckerdt
openaire +3 more sources
We say that a graph $H$ is planar unavoidable if there is a planar graph $G$ such that any red/blue coloring of the edges of $G$ contains a monochromatic copy of $H$, otherwise we say that $H$ is planar avoidable. That is, $H$ is planar unavoidable if there is a Ramsey graph for $H$ that is planar. It follows from the Four-Color Theorem and a result of
Axenovich, M. +3 more
openaire +6 more sources
Weak Degeneracy of Planar Graphs and Locally Planar Graphs
Weak degeneracy is a variation of degeneracy which shares many nice properties of degeneracy. In particular, if a graph $G$ is weakly $d$-degenerate, then for any $(d+1)$-list assignment $L$ of $G$, one can construct an $L$ coloring of $G$ by a modified greedy coloring algorithm.
Ming Han +4 more
openaire +2 more sources
Planarity of Streamed Graphs [PDF]
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A $\textit{streamed graph}$ is a stream of edges $e_1,e_2,...,e_m$ on a vertex set $V$. A streamed graph is $ω$-$\textit{stream planar}$ with respect to a positive integer window size $ω$ if there exists a sequence of planar topological drawings $Γ_i$
Giordano Da Lozzo, Ignaz Rutter
openaire +7 more sources
Planar median graphs and cubesquare-graphs [PDF]
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median graphs.
Carsten R. Seemann +3 more
openaire +5 more sources
The maximum number of pentagons in a planar graph [PDF]
In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an n $n$ ‐vertex planar graph. They precisely determined the maximum number of triangles and four‐cycles and presented a conjecture for the ...
E. Györi +4 more
semanticscholar +1 more source
The Alon-Tarsi number of a planar graph minus a matching [PDF]
This paper proves that every planar graph $G$ contains a matching $M$ such that the Alon-Tarsi number of $G-M$ is at most $4$. As a consequence, $G-M$ is $4$-paintable, and hence $G$ itself is $1$-defective $4$-paintable.
J. Grytczuk, Xuding Zhu
semanticscholar +1 more source
On the planarity of line Mycielskian graph of a graph
The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +1 more source
Planar Graph Perfect Matching Is in NC [PDF]
Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching algorithms.
Nima Anari, V. Vazirani
semanticscholar +1 more source
On the planar edge-length ratio of planar graphs
The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight ...
Manuel Borrazzo, Fabrizio Frati
doaj +1 more source

