Degree sum conditions for cyclability in bipartite graphs

DOI10.1007/S00373-012-1148-0zbMath1268.05114OpenAlexW2013478674MaRDI QIDQ354452

Tomoki Yamashita, Haruko Okamura

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1148-0

zbMATH Keywords

cyclebipartite graphdegree sumcyclability

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• A degree sum condition concerning the connectivity and the independence number of a graph
• Long cycles in bipartite graphs
• On a 2-factor with a specified edge in a graph satisfying the Ore condition
• On long cycles in a 2-connected bipartite graph
• On Hamiltonian bipartite graphs
• Cyclability in bipartite graphs
• 2‐neighborhoods and hamiltonian conditions

This page was built for publication: Degree sum conditions for cyclability in bipartite graphs