scientific article; zbMATH DE number 3977046

MaRDI QIDQ3743338zbMATH OpenFDO

Authors

Publication date 1985

zbMATH Keywords

1-factortoughnesstriangle graph

Mathematics Subject Classification ID

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

Recommendations

• 2-factors in triangle-free graphs
• scientific article; zbMATH DE number 749264
• Characterization of 1-tough graphs using factors
• On hamiltonicity of 1-tough triangle-free graphs
• Toughness and the existence ofk-factors

Cited in

(10)

• A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
• On incidence coloring and star arboricity of graphs
• Perfect matchings of polyomino graphs
• The star arboricity of graphs
• Perfect matchings of generalized polyomino graphs
• Perfect Matchings of the Small Polyominoes
• 2-factors in triangle-free graphs
• scientific article; zbMATH DE number 6129517 (Why is no real title available?)
• scientific article; zbMATH DE number 6794321 (Why is no real title available?)
• Partitioning vertices of graphs into paths of the same length

This page was built for publication:

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