A sufficient condition for all short cycles
From MaRDI portal
Publication:1372730
DOI10.1016/S0166-218X(97)00032-2zbMATH Open0882.05081OpenAlexW2012008904MaRDI QIDQ1372730FDOQ1372730
Authors: Stephan Brandt
Publication date: 18 November 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Recommendations
- scientific article; zbMATH DE number 5371443
- A sufficient condition for dominating cycles
- scientific article; zbMATH DE number 4127255
- scientific article; zbMATH DE number 4194184
- A sufficient condition for cyclability in directed graphs
- A note about shortest cycle covers
- scientific article; zbMATH DE number 819129
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
- On short cycles through prescribed vertices of a graph
- Short cycles via low-diameter decompositions
Cites Work
Cited In (25)
- Degree with neighborhood conditions and highly Hamiltonian graphs
- Stability and Ramsey numbers for cycles and wheels
- Weakly pancyclic graphs
- Exact bipartite Turán numbers of large even cycles
- A theorem on cycle-wheel Ramsey number
- On fan-wheel and tree-wheel Ramsey numbers
- Cycles with a chord in dense graphs
- Minimum degree and pan-\(k\)-linked graphs
- All complete graph-wheel planar Ramsey numbers
- Three results on cycle-wheel Ramsey numbers
- On some three color Ramsey numbers for paths and cycles
- Bounds for two multicolor Ramsey numbers concerning quadrilaterals
- The Ramsey numbers of wheels versus odd cycles
- On the 3-color Ramsey numbers \(R(C_4,C_4,W_n)\)
- On star-critical and upper size Ramsey numbers
- Title not available (Why is that?)
- The Ramsey numbers of two sets of cycles
- Ramsey numbers of odd cycles versus larger even wheels
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Star-critical Ramsey numbers of wheels versus odd cycles
- Ramsey numbers for theta graphs
- Title not available (Why is that?)
- A note on long cycles in sparse random graphs
- Title not available (Why is that?)
- Extremal numbers for odd cycles
This page was built for publication: A sufficient condition for all short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372730)