Longest cycles in tough graphs

DOI10.1002/(SICI)1097-0118(199906)31:2%3C107::AID-JGT4%3E3.0.CO;2-LzbMATH Open0927.05042OpenAlexW4235225454MaRDI QIDQ4248535FDOQ4248535

Authors: P. Wittmann, Heinz A. Jung 

Publication date: 5 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199906)31:2%3C107::aid-jgt4%3E3.0.co;2-l

Recommendations

• Long cycles in graphs with prescribed toughness and minimum degree
• Long paths and cycles in tough graphs
• scientific article; zbMATH DE number 434902

zbMATH Keywords

Hamiltonian cyclecircumferencetoughness

Mathematics Subject Classification ID

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

Cited In (11)

• Toughness in graphs -- a survey
• Longest cycles in threshold graphs
• Spanning paths in graphs
• Length of longest cycles in a graph whose relative length is at least two
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variation of toughness and the length of paths and cycles
• On longest cycles and strongly linking vertex sets
• Hamiltonian properties of graphs with large neighborhood unions
• Long cycles in graphs with prescribed toughness and minimum degree
• Toughness and longest cycles in 2-connected planar graphs

This page was built for publication: Longest cycles in tough graphs

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