Ore-type conditions for the existence of even \([2,b]\)-factors in graphs

DOI10.1016/j.disc.2005.09.009zbMath1077.05085OpenAlexW2073641120MaRDI QIDQ2576834

Haruhide Matsuda

Publication date: 29 December 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.009

zbMATH Keywords

cycletrail

Mathematics Subject Classification ID

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

Related Items (8)

A degree condition implying ore-type condition for even \([2,b\)-factors in graphs] ⋮ 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] ⋮ An odd \([ 1 , b \)-factor in regular graphs from eigenvalues] ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ A degree condition for fractional \([a,b\)-covered graphs] ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Ore-type condition for the existence of \(k\)-factors in graphs
• Note on Hamilton Circuits
• On circuits and pancyclic line graphs
• On Spanning and Dominating Circuits in Graphs
• Spanning 2‐trails from degree sum conditions
• The factorization of graphs. II

This page was built for publication: Ore-type conditions for the existence of even \([2,b]\)-factors in graphs