2-factor with at most two components under a degree sum condition

DOI10.1016/J.DISC.2026.115278MaRDI QIDQ7314027zbMATH OpenFDO

Authors Hongli Liao, Liming Xiong, Zhang Zhang

Publication date 13 August 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115278

Mathematics Subject Classification ID

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

Cites work

• A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
• A note on 2-factors with two components
• A note on Hamiltonian circuits
• A reduction method to find spanning Eulerian subgraphs
• Even factor of a graph with a bounded number of components
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• Every 3-connected claw-free graph of diameter at most 3 has a 2-factor with at most two components
• Forbidden subgraphs that imply 2-factors
• Graph factors and factorization: 1985--2003: a survey
• Graph theory
• scientific article; zbMATH DE number 4055653 (Why is no real title available?)
• On dominating and spanning circuits in graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On factorisation of graphs
• On the number of components in 2-factors of claw-free graphs
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Some Theorems on Abstract Graphs
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• The Factorization of Linear Graphs
• The structure of even factors in claw-free graphs
• Traceability of line graphs
• Two-factors with few cycles in claw-free graphs

This page was built for publication: 2-factor with at most two components under a degree sum condition

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