Vertex-disjoint claws in graphs

DOI10.1016/S0012-365X(99)90069-9zbMATH Open0934.05077OpenAlexW4213121896MaRDI QIDQ1292832FDOQ1292832

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 2188446
• Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
• scientific article; zbMATH DE number 2202192
• Minimum degree and disjoint cycles in claw-free graphs

zbMATH Keywords

minimum degreefactorclaws

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

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

Cited In (12)

• Vertex-Disjoint Stars in Graphs
• Title not available (Why is that?)
• K₄⁻‐factor in a graph
• Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
• \(K_{1,3}\)-factors in graphs
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• Title not available (Why is that?)
• Disjoint cliques in claw-free graphs
• Domination number and Laplacian eigenvalue distribution
• Title not available (Why is that?)
• Graph factors and factorization: 1985--2003: a survey
• LATIN 2004: Theoretical Informatics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292832)