Results 1 to 10 of about 200,785 (277)
Linear arboricity of 1-planar graphs
Discussiones Mathematicae Graph TheorySummary: The linear arboricity \(\text{la}(G)\) of a graph \(G\) is the minimum number of linear forests that partition the edges of \(G\). \textit{J. Akiyama} et al. [Networks 11, 69--72 (1981; Zbl 0479.05027)] conjectured that \(\big\lceil\frac{\Delta(G)}{2}\big\rceil\leq \text{la}(G)\leq\big\lceil\frac{\Delta(G)+1}{2}\big\rceil\) for any simple ...
Weifan Wang, Juan Liu, Yiqiao Wang
openaire +2 more sources
Graphs Drawn With Some Vertices per Face: Density and Relationships
IEEE AccessGraph drawing beyond planarity is a research area that has received an increasing attention in the last twenty years, driven by the necessity to mitigate the visual complexity inherent in geometric representations of non-planar graphs. This research area
Carla Binucci +8 more
doaj +1 more source
Some results on the comaximal ideal graph of a commutative ring [PDF]
Transactions on Combinatorics, 2016 Let R R be a commutative ring with unity. The comaximal ideal graph of R R, denoted by C(R) C(R), is a graph whose vertices are the proper ideals of R R which are not contained in the Jacobson radical of R R, and two vertices I 1 I1 and I 2 I2 are ...
Hamid Reza Dorbidi, Raoufeh Manaviyat
doaj
On 1-Planar Graphs with Bounded Cop-Number
Theoretical Computer ScienceCops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and later the robber chooses a vertex. The cops and robbers make their moves in alternate turns: in the cops' turn, every cop can either choose to move to an adjacent vertex or ...
Prosenjit Bose +3 more
openaire +3 more sources
NP-Completeness Results for Minimum Planar Spanners
Discrete Mathematics & Theoretical Computer Science, 1998 For any fixed parameter t greater or equal to 1, a t-spanner of a graph G is a spanning subgraph in which the distance between every pair of vertices is at most t times their distance in G.
Ulrik Brandes, Dagmar Handke
doaj
Image contraction through fuzzy soft outerplanar graph structures. [PDF]
Sci RepJaisankar D, Ramalingam S, Zegeye GB.
europepmc +1 more source
Zeros of Planar Ising Models via Flat SU(2) Connections. [PDF]
Commun Math PhysLis M.
europepmc +1 more source
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures. [PDF]
Sci RepJaisankar D, Ramalingam S, Zegeye GB.
europepmc +1 more source
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Theory Comput SystBentert M, Fomin FV, Golovach PA.
europepmc +1 more source
Generating Planar Trajectories for Neptunian System Exploration Using Motion Primitives. [PDF]
J Astronaut SciMiceli GE, Bosanac N.
europepmc +1 more source