Results 131 to 140 of about 1,608,691 (253)
The Hamiltonian index of a graph and its branch-bonds [PDF]
, 2001 Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the iterated line graph $L^m(G)$ is hamiltonian is called the hamiltonian index of $G,$ denoted by $h(G).$ A reduction method to determine the hamiltonian ...
Broersma, Haitze J. +4 more
core +1 more source
Fabrication‐Directed Entanglement for Designing Chiral and Anisotropic Metamaterial Foams
Advanced Engineering Materials, Volume 28, Issue 2, January 21, 2026.This work introduces fabrication‐directed entanglement (FDE), combining viscous thread printing and topology optimization to program entangled foams with spatially patterned stiffness. By tuning coil density, FDE enables anisotropy, programmable Poisson's ratio, and chirality in foams.
Daniel Revier +3 more
wiley +1 more source
Eulerian disjoint paths problem in grid graphs is NP-complete
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Discrete Mathematics, 1978 AbstractAn antidirected path [3] in a digraph is a path with consecutive edges directed either both towards or both away from their common vertex. An aneulerian digraph is a digraph that contains a closed antidirected path passing through each edge once.
openaire +2 more sources
Wave run-up and stress imposed on a permeable coastal bed sample of the Caspian Sea
International Journal of Coastal and Offshore Engineering, 2016 This research aims to reconsider the wave run-up and eulerian schematic of flow contours and the fluid movement path in the sediment sample gathered from southern Caspian Seashore bed, using experimental method in wave flume.The general characteristics ...
mojtaba zoljoodi
doaj