Degree sum conditions for Hamiltonicity on \(k\)-partite graphs

DOI10.1007/BF03353011zbMath0886.05087MaRDI QIDQ1376071

Michael S. Jacobson, Guantao Chen

Publication date: 8 April 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

degree sumHamiltonicity\(k\)-partite graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, Chorded pancyclicity in \(k\)-partite graphs, Finding long cycles in balanced tripartite graphs: a first step

Cites Work

• Unnamed Item
• Unnamed Item
• A method in graph theory
• Hamiltonicity in balanced \(k\)-partite graphs
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Hamilton cycles in claw-free graphs
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Insertible vertices, neighborhood intersections, and hamiltonicity
• Hamiltonicity for K_{1, r}‐free graphs
• Some Theorems on Abstract Graphs