Results 41 to 50 of about 151,154 (334)

The degree/diameter problem in maximal planar bipartite graphs [PDF]

open access: yes, 2014
The (¿;D) (degree/diameter) problem consists of nding the largest possible number of vertices n among all the graphs with maximum degree ¿ and diameter D.
Dalfó Simó, Cristina   +2 more
core   +2 more sources

Degeneracies of Triangulated Graphs

open access: yesTheory and Applications of Graphs
A graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate.
Allan Bickle
doaj   +1 more source

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

open access: yes, 2018
We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively.
C Bachmaier   +13 more
core   +1 more source

Biequivalent Planar Graphs

open access: yesAxioms
We define biequivalent planar graphs, which are a generalisation of the uniform polyhedron graphs, as planar graphs made out of two families of equivalent nodes.
Bernard Piette
doaj   +1 more source

Computing Planarity in Computable Planar Graphs

open access: yesGraphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire   +2 more sources

Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]

open access: yes, 2008
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir   +2 more
core   +7 more sources

Contact Representations of Graphs in 3D

open access: yes, 2015
We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there
A Bezdek   +17 more
core   +1 more source

Diffusion Spectrum Imaging Maps Early Axonal Loss and a Unique Progressive Signal in Neuronal Intranuclear Inclusion Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang   +10 more
wiley   +1 more source

The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2019
In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj   +1 more source

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

open access: yesAdvanced Engineering Materials, Volume 27, Issue 6, March 2025.
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy