Results 111 to 120 of about 119,166 (199)
Mitochondrial networks through the lens of mathematics. [PDF]
Phys Biol, 2023 Lewis GR, Marshall WF.
europepmc +1 more source
Truncated degree AT-orientations of outerplanar graphs [PDF]
arXivAn AT-orientation of a graph $G$ is an orientation $D$ of $G$ such that the number of even Eulerian sub-digraphs and the number of odd Eulerian sub-digraphs of $D$ are distinct. Given a mapping $f: V(G) \to \mathbb{N}$, we say $G$ is $f$-AT if $G$ has an AT-orientation $D$ with $ < f(v)$ for each vertex $v$. For a positive integer $k$, we say $G$ is $k$
arxiv
A note on outerplanarity of product graphs [PDF]
, 1991 Pranava K. Jha, Giora Slutzki
openalex +1 more source
Pathwidth of outerplanar graphs
, 2006 We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant $c ...
Coudert, David +2 more
openaire +4 more sources
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
Discussiones Mathematicae Graph Theory, 2015 Given graphs G and H, a vertex coloring c : V (G) →ℕ is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ (H,G), is the minimum number of colors in an H-free coloring of G.
Kubicka Ewa +2 more
doaj +1 more source
Area-Efficient Drawings of Outerplanar Graphs [PDF]
, 2004 Ashim Garg, Adrian Rusu
openalex +1 more source
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
Enumeration of Unlabeled Outerplanar Graphs [PDF]
arXiv, 2005 We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number g_n of unlabeled outerplanar graphs on n vertices can be computed in polynomial time, and g_n is asymptotically $g n^{-5/2}\rho^{-n}$, where $g\approx0.00909941$ and $\rho^{-1}\approx7.50360$ can be approximated.
arxiv