A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs

DOI10.7151/dmgt.1964zbMath1366.05083OpenAlexW2588229365MaRDI QIDQ2364097

Shoichi Tsuchiya, Takamasa Yashima

Publication date: 17 July 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1964

zbMATH Keywords

minimum degree2-edge-connectedeven factor\([a,b\)-factor]

Mathematics Subject Classification ID

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

Related Items (3)

Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b-FACTORS IN GRAPHS] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors]

Cites Work

• Unnamed Item
• Graph factors
• Ore-type conditions for the existence of even \([2,b\)-factors in graphs]
• Even [a,b-factors in graphs]
• Subgraphs with prescribed valencies

This page was built for publication: A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs