Results 41 to 50 of about 3,901 (159)
On k-edge-magic labelings of maximal outerplanar graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau +3 more
doaj +1 more source
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources
On the number of series parallel and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
doaj +1 more source
Outerplanar Obstructions for Matroid Pathwidth
Electronic Notes in Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koutsonas, Athanassios +2 more
openaire +4 more sources
A Polynomial-time Algorithm for Outerplanar Diameter Improvement
, 2014 The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$.
Cohen, Nathann +6 more
core +3 more sources
Nullspace Embeddings for Outerplanar Graphs [PDF]
, 2017 21 pages.
Lovász, L., Schrijver, A.
openaire +4 more sources
Alpha Labeling of Amalgamated Cycles
Theory and Applications of Graphs, 2022 A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set.
Christian Barrientos
doaj +1 more source
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
, 2014 We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing 2-page planarity is fixed-parameter tractable ...
Bannister, Michael J., Eppstein, David
core +1 more source
On infinite outerplanar graphs [PDF]
Mathematica Bohemica, 1994 In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden ...
Boza Prieto, Luis +2 more
openaire +4 more sources
Face Sizes and the Connectivity of the Dual
Journal of Graph Theory, Volume 110, Issue 4, Page 379-391, December 2025.ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann +2 more
wiley +1 more source