Longest paths and longest cycles in graphs with large degree sums

DOI10.1007/S003730200047zbMATH Open1008.05080OpenAlexW2031440960MaRDI QIDQ1865151FDOQ1865151

Authors: Ingo Schiermeyer, Meike Tewes 

Publication date: 25 March 2003

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

Full work available at URL: https://doi.org/10.1007/s003730200047

Recommendations

• A degree sum condition with connectivity for relative length of longest paths and cycles
• Relative length of long paths and cycles in graphs with large degree sums
• Long cycles in graphs with large degree sums
• Relative length of longest paths and cycles in 2-connected graphs
• Relative length of longest paths and cycles in graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (13)

• A degree sum condition with connectivity for relative length of longest paths and cycles
• Long cycles in graphs without Hamiltonian paths
• Relative length of longest paths and cycles in graphs
• Long dominating cycles and paths in graphs with large neighborhood unions
• Relative length of long paths and cycles in graphs with large degree sums
• Finding paths and cycles of superpolylogarithmic length
• Paths of length four
• On relative length of longest paths and cycles
• Longest cycles in 4-connected graphs
• Title not available (Why is that?)
• Longest paths in semicomplete multipartite digraphs
• Title not available (Why is that?)
• Relative length of longest paths and cycles in 2-connected graphs

This page was built for publication: Longest paths and longest cycles in graphs with large degree sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865151)