scientific article; zbMATH DE number 3908470
From MaRDI portal
Publication:3686747
Recommendations
- Longest cycles in 3-connected graphs with given independence number
- Longest cycles in \(k\)-connected graphs with given independence number
- scientific article; zbMATH DE number 568790
- Long path lemma concerning connectivity and independence number
- Length of longest cycles in a graph whose relative length is at least two
Cited in
(12)- A note on circumferences in \(k\)-connected graphs with given independence number
- Cycles in 2-connected graphs
- Large degree vertices in longest cycles of graphs. I
- An existence criterion for a cycle such that the vertices not included in it are independent
- Long path lemma concerning connectivity and independence number
- Longest cycles in \(k\)-connected graphs with given independence number
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Long cycles in triangle-free graphs with prescribed independence number and connectivity
- Large degree vertices in longest cycles of graphs. II
- scientific article; zbMATH DE number 3979098 (Why is no real title available?)
- Longest cycles in 3-connected graphs with given independence number
- scientific article; zbMATH DE number 3961655 (Why is no real title available?)
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 Q3686747)
