Characterizing forbidden pairs for relative length of longest paths and cycles

DOI10.1016/J.DISC.2022.112870zbMath1489.05039OpenAlexW4214808234MaRDI QIDQ2138962

Yibin Fang, Limning Xiong

Publication date: 17 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112870

zbMATH Keywords

circumferencerelative lengthforbidden subgraphforbidden pair

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Dominating cycles and forbidden pairs containing \(P_5\)
• Paw-free graphs
• Relative lengths of paths and cycles in 3-connected graphs
• Relative lengths of paths and cycles in k-connected graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Forbidden subgraphs that imply 2-factors
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden pairs and the existence of a dominating cycle
• On a property of the class of n-colorable graphs
• Note on Hamilton Circuits
• On relative length of longest paths and cycles
• Closure and stable Hamiltonian properties in claw-free graphs
• Relative length of long paths and cycles in graphs with large degree sums
• Some Theorems on Abstract Graphs

This page was built for publication: Characterizing forbidden pairs for relative length of longest paths and cycles