Title:	Hamilton‐connected {claw, net}‐free graphs, I
Other Titles:	 
Authors:	Xia, Liu Ryjáček, Zdeněk Vrána, Petr Xiong, Liming Yang, Xiaojing
Citation:	XIA, L. RYJÁČEK, Z. VRÁNA, P. XIONG, L. YANG, X. Hamilton‐connected {claw, net}‐free graphs, I. Journal of Graph Theory, 2023, roč. 102, č. 1, s. 154-179. ISSN: 0364-9024
Issue Date:	2023
Publisher:	Wiley
Document type:	článek article
URI:	2-s2.0-85135579270 http://hdl.handle.net/11025/50546
ISSN:	0364-9024
Keywords in different language:	claw‐free;closure;forbidden subgraph;Hamilton‐connected;net‐free
Abstract in different language:	This is the first one in a series of two papers, in which we complete the characterization of forbidden generalized nets implying Hamilton‐connectedness of a 3‐connected claw‐free graph. In this paper, we first develop the necessary techniques that allow one to handle the problem, and, by a combination of these techniques, as an application, we prove that every 3‐connected {K(1,3), N(1,3,3)}‐free graph is Hamilton‐connected. The paper is followed by its second part in which we show that every 3‐connected {K(1,3), X}‐free graph, where X ∈ {N(1,1,5), N(2,2,3)}, is Hamilton‐connected. All the results on Hamilton‐connectedness are sharp.
Rights:	Plný text není přístupný. © Wiley
Appears in Collections:	Články / Articles (KMA) Články / Articles (NTIS) OBD

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.