scientific article; zbMATH DE number 7352020

zbMath1479.05176MaRDI QIDQ4990110

Keiko Kotani, Shuto Nishida

Publication date: 28 May 2021

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/79/ajc_v79_p106.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

connectivityminimum degreeedge-connectivity3-factor

Mathematics Subject Classification ID

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

Related Items (1)

Forbidden pairs for connected even factors in supereulerian graphs

Cites Work

• The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
• A degree condition for the existence of regular factors inK1,n-free graphs
• The Factors of Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: