On hamiltonicity of P <Subscript>3</Subscript>-dominated graphs
We introduce a new class of graphs which we call P <Subscript>3</Subscript>-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P <Subscript>3</Subscript>-dominated graph. We prove that G is hamiltonian if α(G <Superscript>2</Superscript>) ≤ κ(G), with two exceptions: K <Subscript>2,3</Subscript> and K <Subscript>1,1,3</Subscript>. We also prove that G is hamiltonian, if G is 3-connected and |V(G)| ≤ 5δ(G) − 5. These results extend known results on (quasi-)claw-free graphs. Copyright Springer-Verlag 2009
Year of publication: |
2009
|
---|---|
Authors: | Broersma, H. ; Vumar, E. |
Published in: |
Mathematical Methods of Operations Research. - Springer. - Vol. 69.2009, 2, p. 297-306
|
Publisher: |
Springer |
Saved in:
Saved in favorites
Similar items by person
-
On hamiltonicity of P 3 -dominated graphs
Broersma, H., (2009)
-
Bloemen, M.J., (1994)
-
On hamiltonicity of P 3-dominated graphs
Broersma, H.J., (2009)
- More ...