Connected even factors in \(k\)-tree

DOI10.1515/math-2020-0106zbMath1475.05102OpenAlexW3119388709MaRDI QIDQ2053544

Yanyan Li

Publication date: 29 November 2021

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

Full work available at URL: https://doi.org/10.1515/math-2020-0106

zbMATH Keywords

even connected factor \([2, 2s\)-factor]

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Toughness and Hamiltonicity in \(k\)-trees
• Toughness, hamiltonicity and split graphs
• Connected even factors in claw-free graphs
• Even Factors of Large Size
• Hamiltonian results inK1,3-free graphs

This page was built for publication: Connected even factors in \(k\)-tree