Results 31 to 40 of about 1,265 (189)
The Toroidal Crossing Number [PDF]
, 2011 Studying the crossing number of the complete bipartite graph K4,n in ...
Ling, Tang +2 more
core +1 more source
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +1 more source
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
AKCE International Journal of Graphs and CombinatoricsA graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj +1 more source
On finding convex cuts in general, bipartite and plane graphs
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roland Glantz, Henning Meyerhenke
openaire +3 more sources
Evaluating the rank generating function of a graphic 2-polymatroid
, 2006 We consider the complexity of the two-variable rank generating function, $S$, of a graphic 2-polymatroid. For a graph $G$, $S$ is the generating function for the number of subsets of edges of $G$ having a particular size and incident with a particular ...
Noble, SD, Noble, Steven
core +1 more source
Bipartite graphs and quasipositive surfaces [PDF]
, 2013 We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.
SEBASTIAN BAADER, Baader, Sebastian
core +1 more source
Decompositions and packings in truncated triangulations
Electronic Journal of Graph Theory and ApplicationsWe study decompositions and packings in truncated triangulations GT△ obtained from simple connected plane graphs G with minimum degree two. We show GT△ is a 3-connected cubic planar graph with at least 2|E(G)|² - 2|E(G)| + 1 perfect matchings, a Λ-factor,
Michael Muzheve
doaj +1 more source
Lower bounds for incidences with hypersurfaces
Discrete Analysis, 2016 Lower bounds for incidences with hypersurfaces, Discrete Analysis 2016:16, 14pp. A fundamental result in combinatorial geometry, the Szemerédi-Trotter theorem, states that among any $n$ points and $m$ lines in $\mathbb R^2$ there can be at most $O((mn)^{
Adam Sheffer
doaj +1 more source
On the skewness of the generalized Heawood graphs
AKCE International Journal of Graphs and CombinatoricsBy the skewness of a graph, we mean the minimum number of its edges whose deletion results in a planar graph. We determine the skewness of a large family of cubic bipartite graphs (which includes the Heawood graph as a special case).
Chii Liang Ng +2 more
doaj +1 more source
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
, 1998 It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, Steven, S. D. Noble, Noble, S D
core +1 more source