Results 91 to 100 of about 231 (167)
Crosscap of the non-cyclic graph of groups
AKCE International Journal of Graphs and Combinatorics, 2016 The non-cyclic graph CG to a non locally cyclic group G is as follows: take G∖Cyc(G) as vertex set, where Cyc(G)={x∈G|〈x,y〉 is cyclic for all y∈G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup.
K. Selvakumar, M. Subajini
doaj +1 more source
A Survey of Maximal k-Degenerate Graphs and k-Trees
Theory and Applications of GraphsThis article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj +1 more source
Mitochondrial networks through the lens of mathematics. [PDF]
Phys Biol, 2023 Lewis GR, Marshall WF.
europepmc +1 more source
On Colorings of Squares of Outerplanar Graphs
, 2007 24 pages, 17 ...
Geir Agnarsson, Magnús M. Halldórsson
openaire +3 more sources
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and ApplicationsA support or realization of a hypergraph $\mathcal{H}$ is a graph \(G\) on the same vertex set as \(\mathcal{H}\) such that for each hyperedge of $\mathcal{H}$ it holds that its vertices induce a connected subgraph of $G$.
René van Bevern +4 more
doaj +1 more source
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
On Vertices Enforcing a Hamiltonian Cycle
Discussiones Mathematicae Graph Theory, 2013 A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor +2 more
doaj +1 more source
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
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Induced cycle structure and outerplanarity
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources