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
- scientific article; zbMATH DE number 749260 (Why is no real title available?)
- scientific article; zbMATH DE number 2104713 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- A minimum degree result for disjoint cycles and forests in graphs
- Cycles in graphs with prescribed stability number and connectivity
- Graph theory
- Minimum degree, independence number and regular factors
- On independent cycles and edges in graphs
- Recent Results on Disjoint Cycles in Graphs
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)
