AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS

DOI10.17654/DM018040455zbMATH Open1499.05521OpenAlexW2770203124MaRDI QIDQ5076243FDOQ5076243

Kengo Sakuraba, Keiko Kotani

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm018040455

Recommendations

• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
• An Ore-type condition for the existence of \(k\)-factors in graphs
• Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs
• On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
• Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Sufficient condition for the existence of \(\left[ {a,b} \right]\)-factors in graphs

zbMATH Keywords

even \([a,b\)-factor]

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Subgraphs with prescribed valencies
• Title not available (Why is that?)
• Even [a,b]-factors in graphs
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS

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