Cycles through subsets with large degree sums
From MaRDI portal
Recommendations
- Cycles through prescribed vertices with large degree sum
- Cycles containing many vertices of subsets in graphs with large degree sums and neighborhood unions
- Cycles through vertices of large maximum degree
- Long cycles in graphs with large degree sums
- Cycles containing many vertices of large degree
- scientific article; zbMATH DE number 2094531
- Cycles containing many vertices of subsets in 1-tough graphs with large degree sums
- Long cycles, degree sums and neighborhood unions
- Degree Sums and Covering Cycles
- scientific article; zbMATH DE number 837058
Cites work
- scientific article; zbMATH DE number 3630799 (Why is no real title available?)
- 2‐neighborhoods and hamiltonian conditions
- A generalization of a result of Häggkvist and Nicoghossian
- A method in graph theory
- A note on Hamiltonian circuits
- Cycles containing many vertices of large degree
- Cycles through specified vertices
- Graph theory
- Long cycles in graphs with large degree sums
- Long cycles, degree sums and neighborhood unions
- New sufficient conditions for cycles in graphs
- Some Theorems on Abstract Graphs
Cited in
(20)- Hamiltonicity of 4-connected graphs
- On degree sum conditions for long cycles and cycles through specified vertices
- Degree sum conditions for the circumference of 4-connected graphs
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- On a cycle through a specified linear forest of a graph
- A \(k\)-tree containing specified vertices
- A look at cycles containing specified elements of a graph
- Relative length of longest paths and longest cycles in triangle-free graphs
- Degree conditions and degree bounded trees
- A Chvátal--Erdős type condition for pancyclability
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs
- On paths and cycles through specified vertices
- An implicit degree condition for cyclability in graphs
- On cycles through specified vertices
- An implicit degree sum condition for cycles through specified vertices
- A degree sum condition concerning the connectivity and the independence number of a graph
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
This page was built for publication: Cycles through subsets with large degree sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363686)
