Results 21 to 30 of about 2,881 (227)
Journal of Graph Algorithms and Applications, 2013 We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axis-aligned line segments, in smooth orthogonal layouts every edge is made of axis-aligned segments
Michael Bekos +3 more
doaj +1 more source
New characterizations of proper interval bigraphs
AKCE International Journal of Graphs and Combinatorics, 2015 A proper interval bigraph is a bigraph where to each vertex we can assign a closed interval such that the intervals can be chosen to be inclusion free and vertices in the opposite partite sets are adjacent when the corresponding intervals intersect.
Ashok Kumar Das, Ritapa Chakraborty
doaj +1 more source
Materials Research Express, 2020 Sr _1−x Ba _x Co _1−x Fe _x O _3− _δ (BSCF) nanoparticles were successfully synthesized with three modified wet chemical techniques; composite mediated hydrothermal method (CMHM), without water and surfactants (WOWS) sol-gel and co-precipitation methods.
Tanveer Akhtar, M Anis-ur-Rehman
doaj +1 more source
Journal of Graph Algorithms and Applications, 2017 This is the second and last chapter of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version (${\rm R{\small EP}}$), a proper
Francisco Soulignac
doaj +1 more source
Partial Characterizations of Circular-Arc Graphs
Electronic Notes in Discrete Mathematics, 2008 AbstractA circular‐arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular‐arc graphs by a list of minimal forbidden induced subgraphs when the graph belongs to ...
Flavia Bonomo +3 more
openaire +5 more sources
Journal of Graph Algorithms and Applications, 2017 This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs.
Francisco Soulignac
doaj +1 more source
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haim Kaplan, Yahav Nussbaum
openaire +2 more sources
On powers of circular arc graphs and proper circular arc graphs
Discrete Applied Mathematics, 1996 Let \(\mathcal K\) denote the class of circular arc graphs. The author gives a new proof that if a graph \(G\in {\mathcal K}\), then the power \(G^n\in {\mathcal K}\) for any positive integer \(n\). Moreover, he proves that if \(G^n\in {\mathcal K}\) then \(G^{n+2}\in {\mathcal K}\) and if \(\text{diam}(G^n)\geq 4\) then \(G^n\in {\mathcal K}\) implies
openaire +2 more sources
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
FEBS Open Bio, EarlyView.MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
Advanced 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