On 2-edge-connected [a,b]-factors of graphs with Ore-type condition

DOI10.1016/J.DISC.2005.01.004zbMATH Open1069.05061OpenAlexW1982519742MaRDI QIDQ2487985FDOQ2487985

Authors: Haruhide Matsuda 

Publication date: 17 August 2005

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

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

Recommendations

• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• Two-edge-connected \([2,k]\)-factors in graphs
• Ore‐type condition for the existence of connected factors
• A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
• Connected \([a,b]\)-factors in graphs

zbMATH Keywords

connected factor

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Note on Hamilton Circuits
• Factors and factorizations of graphs—a survey
• Subgraphs with prescribed valencies
• Two-edge-connected \([2,k]\)-factors in graphs
• A \([k,k+1]\)-factor containing a given Hamiltonian cycle
• A \([k,k+1]\)-factor containing a given Hamiltonian cycle

Cited In (3)

• AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
• Ore-type conditions implying 2-factors consisting of short cycles
• Title not available (Why is that?)

This page was built for publication: On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition

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