Results 61 to 70 of about 28,812 (264)
On Alliance Partitions and Bisection Width for Planar Graphs
Journal of Graph Algorithms and Applications, 2013 An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show how to construct infinitely many non-trivial
Martin Olsen, Morten Revsbaek
doaj +1 more source
Longer Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G − S is an isolated vertex.
Fabrici Igor +3 more
doaj +1 more source
Equitable coloring in 1-planar graphs
Discrete Mathematics9 ...
Daniel W. Cranston, Reem Mahmoud
openaire +2 more sources
The Book Thickness of 1-Planar Graphs is Constant [PDF]
Algorithmica, 2016 In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges on the same page do not cross. In this paper, we prove that every $1$-planar graph (that is, a graph that can be drawn on the plane such that no edge is crossed more than once) admits an embedding in a book with constant ...
Michael A. Bekos +3 more
openaire +3 more sources
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
Advanced Engineering Materials, EarlyView.This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
Discussiones Mathematicae Graph Theory, 2013 We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40+1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
Borodin Oleg V., Ivanova Anna O.
doaj +1 more source
Additive Manufacturing of Alumina‐Reinforced Elastomers
Advanced Engineering Materials, EarlyView.Vat‐photopolymerized elastomers reinforced with platelet‐shaped alumina exhibited preferential orientation, reduced porosity, and significantly enhanced mechanical performance. A 3 wt% platelet loading increased tensile strength from 12.4 to 45.7 MPa, highlighting the critical role of filler morphology in elastomeric VPP composites.
Majid Barzegar Keyvani +6 more
wiley +1 more source
On the Book Thickness of 1-Planar Graphs
CoRR, 2015 In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page do not cross each other. The minimum number of pages in which a graph can be embedded is called the book-thickness
Md. Jawaherul Alam +2 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ +19 more
wiley +1 more source