Cycles through subsets with large degree sums
From MaRDI portal
Publication:1363686
DOI10.1016/S0012-365X(96)00071-4zbMATH Open0883.05089OpenAlexW1976464549MaRDI QIDQ1363686FDOQ1363686
Henk Jan Veldman, Jianping Li, Feng Tian, Hao Li, Hajo Broersma
Publication date: 10 August 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00071-4
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- A note on Hamiltonian circuits
- 2‐neighborhoods and hamiltonian conditions
- Cycles through specified vertices
- New sufficient conditions for cycles in graphs
- A method in graph theory
- A generalization of a result of Häggkvist and Nicoghossian
- Long cycles in graphs with large degree sums
- Long cycles, degree sums and neighborhood unions
- Cycles containing many vertices of large degree
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 condition for the existence of a cycle intersecting specified connected subgraphs
- A Chvátal--Erdős type condition for pancyclability
- On paths and cycles through specified vertices
- 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
- An Implicit Degree Condition for Cyclability in Graphs
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Degree Sums and Covering Cycles 👍 👎
- Cycles through prescribed vertices with large degree sum 👍 👎
- Long cycles in graphs with large degree sums 👍 👎
- Cycles through vertices of large maximum degree 👍 👎
- Long cycles, degree sums and neighborhood unions 👍 👎
- Cycles containing many vertices of large degree 👍 👎
- Cycles containing many vertices of subsets in 1-tough graphs with large degree sums 👍 👎
- Cycles containing many vertices of subsets in graphs with large degree sums and neighborhood unions 👍 👎
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)
