scientific article; zbMATH DE number 3952821
From MaRDI portal
Publication:3722541
Recommendations
- A Chvátal-Erdős condition for (1,1)-factors in digraphs
- A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs
- The existence of a 2-factor in a graph satisfying the local Chvátal-Erdős condition
- scientific article; zbMATH DE number 1109394
- A chvátal–erdős type condition for hamiltonian graphs
- A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
- The Chvátal-Erdös condition for cycles in triangle-free graphs
- scientific article; zbMATH DE number 4160763
- The Chvátal-Erdős condition for group connectivity in graphs
- The Chvátal-Erdős condition and pancyclic line-graphs
Cited in
(9)- A Chvátal-Erdős condition for (1,1)-factors in digraphs
- Minimum degree, independence number and regular factors
- Connected \(k\)-factors in bipartite graphs
- A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdős condition
- Chvátal Erdős condition and 2-factors with a specyfied number of components
- A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
- Independence number, connectivity, and r‐factors
- A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722541)