Results 91 to 100 of about 30,213,529 (145)

Extensions and variations of the two-person game on graphs [PDF]

, 2011
Khachatryan A. Extensions and variations of the two-person game on graphs.
Khachatryan, Anush
core  

Embeddability of graphs into the Klein surface [PDF]

, 2010
Flötotto A. Embeddability of graphs into the Klein surface.
Flötotto, Anna
core  

Large matchings in maximal 1-planar graphs

Discrete Mathematics
It is well-known that every maximal planar graph has a matching of size at least $\tfrac{n+8}{3}$ if $n\geq 14$. In this paper, we investigate similar matching-bounds for maximal \emph{1-planar} graphs, i.e., graphs that can be drawn such that every edge has at most one crossing.
Therese Biedl, John Wittnebel
openaire   +3 more sources

On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords

Discussiones Mathematicae Graph Theory, 2019
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains ...
Sun Lin, Wu Jianliang
doaj   +1 more source

On 1-Planar Graphs with Bounded Cop-Number

Theoretical Computer Science
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and later the robber chooses a vertex. The cops and robbers make their moves in alternate turns: in the cops' turn, every cop can either choose to move to an adjacent vertex or ...
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali 0001   +3 more
openaire   +5 more sources

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]

Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core  

Strictly-convex drawings of 3-connected planar graphs

Journal of Computational Geometry
Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings of $n$-vertex graphs is $O(n^2) \times O(n^2)$, as shown by ...
Michael Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis   +3 more
doaj   +1 more source

On the d-independence number in 1-planar graphs

Graphs and Combinatorics
The $d$-independence number of a graph $G$ is the largest possible size of an independent set $I$ in $G$ where each vertex of $I$ has degree at least $d$ in $G$. Upper bounds for the $d$-independence number in planar graphs are well-known for $d=3,4,5$, and can in fact be matched with constructions that actually have minimum degree $d$.
Therese Biedl, Prosenjit Bose, Babak Miraftab   +2 more
openaire   +3 more sources

Graph Sketcher: extending illustration to quantitative graphs

, 2009
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantitative concept diagrams (QCDs).
Stewart, Robin, m.c. schraefel, schraefel, m.c., Robin Stewart   +3 more
core   +1 more source

Oriented L(2, 1)-labeling of planar graphs

, 2011
In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention to the subclasses of oriented prisms, Halin and ...
Tiziana Calamoneri, Blerina Sinaimeri
core   +1 more source