Results 111 to 120 of about 3,335 (132)
Some of the next articles are maybe not open access.
Journal of Molecular Structure: THEOCHEM, 1999
Abstract The model selected in order to assign a canonical name to a molecule in organic chemistry usually uses a graph theoretical edge set joining carbon nodes. For aliphatic compounds the most efficient type nomenclature involves the concatenation of Eulerian paths.
openaire +1 more source
Abstract The model selected in order to assign a canonical name to a molecule in organic chemistry usually uses a graph theoretical edge set joining carbon nodes. For aliphatic compounds the most efficient type nomenclature involves the concatenation of Eulerian paths.
openaire +1 more source
Traversing Graphs: The Eulerian and Hamiltonian Theme
2000This chapter deals with basic graph theoretical concepts and then focuses on special topics which are — in their applications — of relevance to theoretical and practical problems in OR. Therefore, this chapter is structured as follows: 1. Basics of Graph Theory. 2. Connectivity, Menger’s Theorem, the Splitting Lemma, and Factors.
openaire +1 more source
On hamiltonian line graphs of hypergraphs
Journal of Graph Theory, 2022Xiaofeng Gu, Hong-Jian Lai, Sulin Song
exaly
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.
2017A. Benkouar +3 more
openaire +2 more sources