A Note on a Generalisation of Ore’s Condition
✍ Scribed by Evelyne Flandrin; Hao Li; Antoni Marczyk; Mariusz Woźniak
- Publisher
- Springer Japan
- Year
- 2005
- Tongue
- English
- Weight
- 236 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Derivations of an expression for the generalised outgoing 'adsorption' time-lag pertaining to transport through a slab membrane made by [Rutherford and Do, Review of time lag permeation technique as a method for characterisation of porous media and membranes, Adsorption 3 (1997) 283] and by [Ash et
For an integer i, a graph is called an L,-graph if, for each triple of vertices u, u , w with and Khachatrian proved that connected Lo-graphs of order a t least 3 are hamiltonian, thus improving Ore's Theorem. All K1,3-free graphs are L1-graphs, whence recognizing hamiltonian L1-graphs is an NP-com