Cycles through subsets with large degree sums

DOI10.1016/S0012-365X(96)00071-4zbMath0883.05089OpenAlexW1976464549MaRDI QIDQ1363686

Henk Jan Veldman, Jianping Li, Feng Tian, Hao Li, Hajo J. 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

zbMATH Keywords

independence numberconnectivityHamiltonian cycledegree sum\(X\)-cyclable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs, On paths and cycles through specified vertices, A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs, On a cycle through a specified linear forest of a graph, A \(k\)-tree containing specified vertices, A Chvátal--Erdős type condition for pancyclability, An implicit degree sum condition for cycles through specified vertices, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, Degree sum conditions for the circumference of 4-connected graphs, Disjoint cycles in hypercubes with prescribed vertices in each cycle, An Implicit Degree Condition for Cyclability in Graphs, Relative length of longest paths and longest cycles in triangle-free graphs, Hamiltonicity of 4-connected graphs, Set-orderedness as a generalization of \(k\)-orderedness and cyclability, On cycles through specified vertices, Forbidden subgraphs and the existence of paths and cycles passing through specified vertices, On degree sum conditions for long cycles and cycles through specified vertices, A degree sum condition concerning the connectivity and the independence number of a graph, Degree conditions and degree bounded trees, A look at cycles containing specified elements of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• Long cycles in graphs with large degree sums
• New sufficient conditions for cycles in graphs
• A generalization of a result of Häggkvist and Nicoghossian
• Cycles containing many vertices of large degree
• A method in graph theory
• Long cycles, degree sums and neighborhood unions
• A note on Hamiltonian circuits
• 2‐neighborhoods and hamiltonian conditions
• Some Theorems on Abstract Graphs