Characterization of forbidden subgraphs for the existence of even factors in a graph

DOI10.1016/j.dam.2017.02.015zbMath1465.05148OpenAlexW2593770371MaRDI QIDQ2030443

Limning Xiong

Publication date: 7 June 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2017.02.015

zbMATH Keywords

claw-free grapheven factorforbidden graphchair-free graphbranch bond

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Spectral radius conditions for fractional \([a,b\)-covered graphs] ⋮ Forbidden subgraphs for supereulerian and Hamiltonian graphs ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ On \(P_{\geq 3}\)-factor deleted graphs

Cites Work

• Unnamed Item
• 2-factors with the bounded number of components in line graphs
• Hamiltonian index is NP-complete
• The existence of even factors in iterated line graphs
• Characterizing forbidden pairs for hamiltonian properties
• The Hamiltonian index of a graph and its branch-bonds
• Supereulerian graphs and excluded induced minors
• Forbidden subgraphs and the existence of a 2-factor
• The upper bound of the number of cycles in a 2-factor of a line graph

This page was built for publication: Characterization of forbidden subgraphs for the existence of even factors in a graph