K₁,3-factors in graphs

DOI10.1016/J.DISC.2007.11.013zbMATH Open1204.05075OpenAlexW2055226951MaRDI QIDQ998329FDOQ998329

Authors: Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota 

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.013

Recommendations

• scientific article; zbMATH DE number 4200251
• On connected factors in \(K_{1,3}\)-free graphs
• Regular factors in K_1,3‐free graphs
• On factorial subclasses of \(K_{1,3}\)-free graphs
• \(K_\ell^-\)-factors in graphs
• \(k\) -factors in regular graphs
• scientific article; zbMATH DE number 7448387
• A class of large sets of \(K_{1,3}\)-factors of complete tripartite graphs
• scientific article; zbMATH DE number 6129517
• Connected \([k,k+1]\)-factors of graphs

zbMATH Keywords

minimum degreeclawfactorvertex-disjoint subgraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture
• Title not available (Why is that?)
• An El-Zah�r type condition ensuring path-factors
• On circuits in graphs
• K₄⁻‐factor in a graph
• Vertex-disjoint claws in graphs

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• (k+1)-Cores Have k-Factors
• K₄⁻‐factor in a graph
• The existence of \(P_{\geq3}\)-factor covered graphs
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• Subgraphs in vertex neighborhoods ofKr-free graphs
• Vertex-disjoint copies of K₄^-
• Title not available (Why is that?)
• Vertex disjoint equivalent subgraphs of order 3

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

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