Graphic sequences with a realization containing cycles C₃, , C_
From MaRDI portal
Publication:2010728
Recommendations
Cites work
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 5124628 (Why is no real title available?)
- scientific article; zbMATH DE number 3758373 (Why is no real title available?)
- scientific article; zbMATH DE number 7491851 (Why is no real title available?)
- scientific article; zbMATH DE number 2188455 (Why is no real title available?)
- A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic
- A variation of an extremal theorem due to Woodall
- Algorithms for constructing graphs and digraphs with given valences and factors
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- Graph theory with applications
- On potentially \(_kC_l\)-graphic sequences
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
Cited in
(6)- scientific article; zbMATH DE number 7403609 (Why is no real title available?)
- Degree sequences of graphs containing a cycle with prescribed length
- A characterization for a graphic sequence to have a realization containinga a desired cycle
- On a problem of potentially pancyclic-graphic sequences due to S.B. Rao
- Graphic sequences with an \(A\)-connected realization
- On potentially \(_kC_l\)-graphic sequences
This page was built for publication: Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010728)