Regular factors in K1,3‐free graphs

DOI10.1002/jgt.3190150304zbMath0756.05087OpenAlexW2207060468MaRDI QIDQ3978368

M. S. Paulraj, Sheshayya A. Choudum

Publication date: 25 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150304

zbMATH Keywords

minimum degreeregular factors\(K_{1,3}\)-free graphs

Mathematics Subject Classification ID

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

Related Items (20)

Claw-free graphs and 2-factors that separate independent vertices ⋮ Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs ⋮ Claw-free graphs---a survey ⋮ Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs ⋮ Circumferences of 2-factors in claw-free graphs ⋮ 2-Factors in claw-free graphs with locally disconnected vertices ⋮ On components of 2-factors in claw-free graphs ⋮ 2-factors with the bounded number of components in line graphs ⋮ On 2-factors with a bounded number of odd components ⋮ On 2-factors in claw-free graphs whose edges are in small cycles ⋮ 2-factors and independent sets on claw-free graphs ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ Even subgraphs of bridgeless graphs and 2-factors of line graphs ⋮ On the number of components in 2-factors of claw-free graphs ⋮ Unnamed Item ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Computing sharp 2-factors in claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ Two operations on a graph preserving the (non)existence of 2-factors in its line graph ⋮ On connected factors in \(K_{1,3}\)-free graphs

Cites Work

• The Factors of Graphs
• Unnamed Item

This page was built for publication: Regular factors in K_1,3‐free graphs