Trestles in the squares of graphs

dc.contributor.author	Kabela, Adam
dc.contributor.author	Teska, Jakub
dc.date.accessioned	2021-12-06T11:00:26Z
dc.date.available	2021-12-06T11:00:26Z
dc.date.issued	2021
dc.description.abstract-translated	We show that the square of every connected S(K_{1,4})-free graph satisfying a matching condition has a 2-connected spanning subgraph of maximum degree at most 3. Furthermore, we characterise trees whose square has a 2-connected spanning subgraph of maximum degree at most k. This generalises the results on S(K_{1,3})-free graphs of Henry and Vogler (1985) and Harary and Schwenk (1971), respectively.	en
dc.format	10 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	KABELA, A. TESKA, J. Trestles in the squares of graphs. DISCRETE MATHEMATICS, 2021, roč. 344, č. 11, s. nestránkováno. ISSN: 0012-365X	cs
dc.identifier.document-number	690796100014
dc.identifier.doi	10.1016/j.disc.2021.112532
dc.identifier.issn	0012-365X
dc.identifier.obd	43933881
dc.identifier.uri	2-s2.0-85113154134
dc.identifier.uri	http://hdl.handle.net/11025/46283
dc.language.iso	en	en
dc.project.ID	GA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafy	cs
dc.publisher	Elsevier	en
dc.relation.ispartofseries	Discrete Mathematics	en
dc.rights.access	openAccess	en
dc.subject.translated	squares of graphs, Hamiltonicity, trestles, forbidden subgraphs	en
dc.title	Trestles in the squares of graphs	en
dc.type	preprint	cs
dc.type	preprint	en
dc.type.version	draft	en

Collections