K₁,3-factors in graphs
From MaRDI portal
Publication:998329
Recommendations
- scientific article; zbMATH DE number 4200251
- On connected factors in \(K_{1,3}\)-free graphs
- Regular factors in K1,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
Cites work
- scientific article; zbMATH DE number 4191728 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- K4−‐factor in a graph
- An El-Zah�r type condition ensuring path-factors
- On circuits in graphs
- On the maximal number of independent circuits in a graph
- Proof of the Alon-Yuster conjecture
- Vertex-disjoint claws in graphs
Cited in
(11)- Vertex disjoint equivalent subgraphs of order 3
- scientific article; zbMATH DE number 6129517 (Why is no real title available?)
- scientific article; zbMATH DE number 7448387 (Why is no real title available?)
- scientific article; zbMATH DE number 4200251 (Why is no real title available?)
- (k+1)-Cores Have k-Factors
- K4−‐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 K4-
- scientific article; zbMATH DE number 749264 (Why is no real title available?)
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)