On pseudo 2-factors

DOI10.1016/j.dam.2008.07.002zbMath1172.05341OpenAlexW1997302264MaRDI QIDQ1028474

Siham Bekkai, Mekkia Kouider

Publication date: 30 June 2009

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

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

zbMATH Keywords

cycleindependence number2-factorminimum degreepseudo 2-factor

Mathematics Subject Classification ID

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

Related Items (4)

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Minimum degree, independence number and pseudo \([2, b\)-factors in graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimum degree result for disjoint cycles and forests in graphs
• Cycles in graphs with prescribed stability number and connectivity
• Minimum degree, independence number and regular factors
• On independent cycles and edges in graphs
• Recent Results on Disjoint Cycles in Graphs

This page was built for publication: On pseudo 2-factors