Results 121 to 130 of about 850,474 (224)
Mitochondrial networks through the lens of mathematics. [PDF]
Lewis GR, Marshall WF.
europepmc +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
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
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
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
The complexity of frugal colouring. [PDF]
Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Area-Efficient Drawings of Outerplanar Graphs [PDF]
Ashim Garg, Adrian Rusu
openalex +1 more source
Light graphs in families of outerplanar graphs
We prove that every 2-connected outerplanar graph of order at least k (k>=3) contains a path on k vertices with all vertices of degree at most k+3 and a path on k vertices with degree sum at most 4k-2. Further, every 2-connected outerplanar graph without adjacent vertices with degree sum =
openaire +2 more sources
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
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
Small Area Drawings of Outerplanar Graphs [PDF]
Giuseppe Di Battista, Fabrizio Frati
openalex +1 more source
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
A study of upper ideal relation graphs of rings
Let R be a ring with unity. The upper ideal relation graph [Formula: see text] of the ring R is the simple undirected graph whose vertex set is the set of all non-unit elements of R and two distinct vertices x, y are adjacent if and only if there exists ...
Barkha Baloda+2 more
doaj +1 more source