Connected even factors in k-tree

DOI10.1515/MATH-2020-0106MaRDI QIDQ2053544zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 29 November 2021

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

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

Recommendations

• Toughness and the existence ofk-factors
• On a connection between the existence of k-trees and the toughness of a graph
• scientific article; zbMATH DE number 6475977
• Connected even factors in claw-free graphs
• Toughness and the existence of k-factors. II

Cites work

• scientific article; zbMATH DE number 6475977 (Why is no real title available?)
• Connected even factors in claw-free graphs
• Even factors of large size
• Graph theory with applications
• Hamiltonian results inK1,3-free graphs
• Toughness and Hamiltonicity in k-trees
• Toughness, hamiltonicity and split graphs

Cited in

(1)

• On tree factorizations of K_n

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

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