Results 111 to 120 of about 3,567 (160)
Traversing Graphs: The Eulerian and Hamiltonian Theme
, 2000 This 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.
H. Fleischner
semanticscholar +4 more sources
Eulerian and Hamiltonian Graphs
Chromatic Graph Theory, 2008 G. Chartrand, Ping Zhang
semanticscholar +5 more sources
Eulerian Multigraphs and Hamiltonian Graphs
, 2007 Koh Khee Meng +2 more
semanticscholar +5 more sources
Hamiltonian and Eulerian properties of entire graphs
, 1972 J. Mitchem
semanticscholar +4 more sources
On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs
International Symposium on Algorithms, 1991 Vangelis Th. Paschos +3 more
semanticscholar +4 more sources
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.
Seymour B. Elk
openaire +3 more sources