On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition

DOI10.1016/j.disc.2005.01.004zbMath1069.05061MaRDI QIDQ2487985

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

zbMATH Keywords

connected factor

Mathematics Subject Classification ID

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

05C45: Eulerian and Hamiltonian graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Note on Hamilton Circuits
• Factors and factorizations of graphs—a survey
• Subgraphs with prescribed valencies
• A \([k,k+1\)-factor containing a given Hamiltonian cycle]
• A \([k,k+1\)-factor containing a given Hamiltonian cycle]