Vertex-disjoint claws in graphs

DOI10.1016/S0012-365X(99)90069-9zbMath0934.05077OpenAlexW4213121896MaRDI QIDQ1292832

Yoshimi Egawa, Katsuhiro Ota

Publication date: 10 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90069-9

zbMATH Keywords

minimum degreefactorclaws

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

K₄⁻‐factor in a graph ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs ⋮ Domination number and Laplacian eigenvalue distribution ⋮ \(K_{1,3}\)-factors in graphs

Cites Work

• On circuits in graphs
• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• \(H\)-factors in dense graphs
• Regular factors in K_1,n free graphs
• Vertex-Disjoint Stars in Graphs
• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex-disjoint claws in graphs