It has been conjectured that any 5-connected graph embedded in a surface with sufficiently large face-width is hamiltonian. This conjecture was verified by Yu for the triangulation case, but it is still open in general. The conjecture is not true for 4-connected graphs. In this article, we shall stu
On path factors in certain graphs of mixed degree 2 and 3
โ Scribed by Jack L Hursch Jr.
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 290 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract In a recent paper, Barnette showed that every 3โconnected planar graph has a 2โconnected spanning subgraph of maximum degree at most fifteen, he also constructed a planar triangulation that does not have 2โconnected spanning subgraphs of maximum degree five. In this paper, we show that
## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2โcolorable __K__โfree 3โgraph (where __K__={123, 124, 134} ). The 2โchromatic Turรกn density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}
## Abstract Kinetic study on the cleavage of __N__โphenylphthalimide (NPhPT) in the presence of 0.05 M NH~2~NH~2~ and mixed H~2~OโCH~3~CN solvents reveals the occurrence of reaction scheme equation image where A, B, C, C~1~, An, E, and F represent NPhPT, __o__โCO^โ^~2~C~6~H~4~CONHC~6~H~5~, __o__โ