Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Gethner, Ellen"'
Publikováno v:
Journal of Graph Algorithms and Applications, 25(2):643-661 (2021)
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each edge parti
Externí odkaz:
http://arxiv.org/abs/1911.02040
Autor:
Gethner, Ellen, Hogben, Leslie, Lidický, Bernard, Pfender, Florian, Ruiz, Amanda, Young, Michael
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing (with edges
Externí odkaz:
http://arxiv.org/abs/1410.0720
Given a group $\Gamma$ acting on a set $X$, a $k$-coloring $\phi:X\to\{1,\dots,k\}$ of $X$ is distinguishing with respect to $\Gamma$ if the only $\gamma\in \Gamma$ that fixes $\phi$ is the identity action. The distinguishing number of the action $\G
Externí odkaz:
http://arxiv.org/abs/1405.5558
Autor:
Gethner, Ellen
At the heart of the ideas of the work of Dutch graphic artist M.C. Escher is the idea of automation. We consider one such problem that was inspired by some of his earlier and lesser known work [MWS96, Sc90, Sc97, Er76, Es86]. From a finite set of (po
Externí odkaz:
http://hdl.handle.net/2429/12987
A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing coloring of G
Externí odkaz:
http://arxiv.org/abs/1111.4989
Publikováno v:
In European Journal of Combinatorics August 2018 72:12-28
Publikováno v:
Discrete Mathematics. 262(1-3):59-77. 2003
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in the plane,
Externí odkaz:
http://arxiv.org/abs/cs/0009028
Publikováno v:
Electronic Journal of Combinatorics. 8(1):R23 1-30. 2001
A drawing of a graph G in the plane is said to be a rectilinear drawing of G if the edges are required to be line segments (as opposed to Jordan curves). We assume no three vertices are collinear. The rectilinear crossing number of G is the fewest nu
Externí odkaz:
http://arxiv.org/abs/cs/0009023
Autor:
Gethner, Ellen
Publikováno v:
Proceedings of the American Mathematical Society, 1999 Jan 01. 127(1), 1-10.
Externí odkaz:
https://www.jstor.org/stable/118907