Extremal problems and generalized degrees

DOI10.1016/0012-365X(92)00473-5zbMath0796.05049OpenAlexW2039411520MaRDI QIDQ1322223

Paul Erdős, Ralph J. Faudree, Cecil C. Rousseau

Publication date: 5 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00473-5

zbMATH Keywords

cyclesHamiltonian pathsgeneralized degreeextremal numbersgeneralized independent degree

Mathematics Subject Classification ID

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

Related Items

A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, On a problem of Erdős and Rothschild on edges in triangles, Books in graphs, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs

Cites Work

• Neighbourhood unions and Hamiltonian properties in graphs
• Neighborhood unions and a generalization of Dirac's theorem
• Note on Hamilton Circuits
• Complete subgraphs with large degree sums
• The Largest Vertex Degree Sum for a Triangle in a Graph
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item