On connected factors in \(K_{1,3}\)-free graphs

DOI10.1007/BF02677347zbMath0929.05071OpenAlexW1975461573MaRDI QIDQ1299861

Zhenhong Liu, Guo Jun Li

Publication date: 30 August 1999

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02677347

zbMATH Keywords

spanning treeconnected factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Graph factors and factorization: 1985--2003: a survey

Cites Work

• Unnamed Item
• Hamiltonian results inK1,3-free graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Regular factors in K_1,3‐free graphs

This page was built for publication: On connected factors in \(K_{1,3}\)-free graphs