On pseudo 2-factors
From MaRDI portal
Publication:1028474
DOI10.1016/J.DAM.2008.07.002zbMATH Open1172.05341OpenAlexW1997302264MaRDI QIDQ1028474FDOQ1028474
Authors: 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
Recommendations
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices
- scientific article; zbMATH DE number 2186975
- Disjoint cycles with prescribed lengths and independent edges in graphs
Cites Work
- Graph theory
- Cycles in graphs with prescribed stability number and connectivity
- Title not available (Why is that?)
- A minimum degree result for disjoint cycles and forests in graphs
- Recent Results on Disjoint Cycles in Graphs
- On independent cycles and edges in graphs
- Minimum degree, independence number and regular factors
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
- Grinstead's conjecture is true for graphs with a small clique number
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
This page was built for publication: On pseudo 2-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028474)
