\P₂,C_i i 3\-covered graphs

MaRDI QIDQ2767378zbMATH OpenFDO

Authors Run Nian Ma

Publication date 29 January 2002

Published in Advances in Mathematics (Beijing) (Search for Journal in Brave)

zbMATH Keywords

factor covered graph

Mathematics Subject Classification ID

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

Recommendations

• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• The existence of \(P_{\geq3}\)-factor covered graphs
• The existence of path-factor covered graphs
• scientific article; zbMATH DE number 4110739
• Criterion for a type of (g,f)-3-covered graphs

Cited in

(2)

• The existence of \(P_{\geq3}\)-factor covered graphs
• scientific article; zbMATH DE number 5233136 (Why is no real title available?)

This page was built for publication: \(\{P_2,C_i\mid i\geq 3\}\)-covered graphs

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