scientific article; zbMATH DE number 3908470
From MaRDI portal
Publication:3686747
zbMATH Open0569.05034MaRDI QIDQ3686747FDOQ3686747
Authors: Irene Fournier 
Publication date: 1985
Title of this publication is not available (Why is that?)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Longest cycles in 3-connected graphs with given independence number
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)
