Results 51 to 60 of about 76,992 (320)
Hamiltonian cycles and subsets of discounted occupational measures
, 2019 We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding particular extreme points of a certain polytope associated with the input ...
Eshragh, Ali +3 more
core +1 more source
A Survey on Hamiltonian Cycles
Interdisciplinary Information Sciences, 2001 The author surveys some of the classical results on Hamiltonian cycles in undirected graphs and pays particular attention to the development over the last decade. Among the subjects are: binding number, toughness, degree conditions, closure, regular graphs, and graphs on surfaces. This is intended as a supplement to the survey of \textit{R. J.
openaire +4 more sources
On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
Discussiones Mathematicae Graph Theory, 2015 A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. In this note, we prove that claw-free graphs with minimum degree at least 3 are not uniquely Hamiltonian.
Seamone Ben
doaj +1 more source
Hamiltonian chordal graphs are not cycle extendible [PDF]
, 2014 In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater.
Lafond, Manuel, Seamone, Ben
core
Advanced Engineering Materials, EarlyView.Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
Fan's condition on induced subgraphs for circumference and pancyclicity [PDF]
Opuscula Mathematica, 2017 Let \(\mathcal{H}\) be a family of simple graphs and \(k\) be a positive integer. We say that a graph \(G\) of order \(n\geq k\) satisfies Fan's condition with respect to \(\mathcal{H}\) with constant \(k\), if for every induced subgraph \(H\) of \(G ...
Wojciech Wideł
doaj +1 more source
Small cycles in Hamiltonian graphs
Discrete Applied Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ingo Schiermeyer, Uwe Schelten
openaire +2 more sources
Advanced Engineering Materials, EarlyView.The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley +1 more source
Extending a perfect matching to a Hamiltonian cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Adel Alahmadi +5 more
doaj +1 more source
Advanced Functional Materials, Volume 35, Issue 12, March 18, 2025.In this study, the unique role of the unusual lone‐pair‐π conjugation mechanism in poly(1,4‐anthraquinone) (P14AQ) is explored as an organic electrode material. Unlike traditional π‐π interactions, P14AQ's conjugation involves lone pairs of oxygen atoms interacting with the π cloud of adjacent units, enabling stable charge transport even with minimal π‐
Xiaotong Zhang, Piotr de Silva
wiley +1 more source