Results 111 to 120 of about 27,053 (309)
Triangle Decompositions of Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e of G, the sum
Mynhardt Christina M. +1 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2001 Abstract Abstract We generalize the idea of extended triangles of a graph G by considering a family of completes of G instead of the clique family of G. We characterize Helly and 3 - Helly Planar Graphs using extended triangles. We prove that if a planar graph is a clique graph then any one of its extended triangles is a clique graph.
Liliana Alcón, Marisa Gutierrez
openaire +1 more source
Advanced Functional Materials, EarlyView.Cyclic unloading‐aging‐reloading micro‐tensile tests under various aging durations and temperatures, combined with comprehensive microstructural characterization reveal that the yield point phenomenon in Aluminum‐Carbon (Al‐C) thin films originates from Cottrell atmosphere formation.
Zion Lee +10 more
wiley +1 more source
Strictly-convex drawings of 3-connected planar graphs
Journal of Computational GeometryStrictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings of $n$-vertex graphs is $O(n^2) \times O(n^2)$, as shown by ...
Michael Bekos +3 more
doaj +1 more source
Decomposing a Planar Graph into Degenerate Graphs
Journal of Combinatorial Theory, Series B, 1995 A graph \(G\) is \(k\)-degenerate if every subgraph of \(G\) has a vertex of degree less than \(k\). The author proves that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph.
openaire +2 more sources
Advanced Functional Materials, EarlyView.Magnetic‐field‐assisted CVD of heterometallic single‐source precursors modulates thin‐film surface electronic structure and interfacial charge transfer. Field‐grown (Cobalt ferrite‐1T)CF‐1T films exhibit stabilized electronic states, lower kinetic barriers, and markedly enhanced nitrate‐to‐ammonia electrocatalysis versus (Cobalt ferrite‐0T) CF‐0T ...
Touraj Karimpour +11 more
wiley +1 more source
Cycle spectra of contraction-critically 4-connected planar graphs
, 2021 Motivated by the long-standing and wide open pancyclicity conjectures of Bondy and Malkevitch, we study the cycle spectra of contraction-critically 4-connected planar graphs.
Lo, On-Hei Solomon, Schmidt, Jens M.
core
Planarization of Clustered Graphs [PDF]
, 2002 We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.
Di Battista G. +2 more
openaire +1 more source
Advanced Functional Materials, EarlyView.Metasurfaces and other structured photonic environments can dramatically modify the absorption and/or light emission of semiconductors. However, the consequences of these changes on the temperature of the system are not well understood. The authors address this problem for colloidal nanocrystals and leverage their findings to convert light into ...
Hugo Kowalczyk +7 more
wiley +1 more source
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +1 more source