Endpoint extendable paths in dense graphs

DOI10.1016/J.DISC.2011.09.014zbMATH Open1246.05085OpenAlexW1967676881MaRDI QIDQ442374FDOQ442374

Authors: Guantao Chen, Hao Li, Zhiquan Hu 

Publication date: 10 August 2012

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

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

Recommendations

• Path extendability and degree sum in graphs.
• A sufficient condition for path extendable graphs
• Path extendable graphs
• Extending paths and degree sums in graphs
• Path extendability of claw-free graphs

zbMATH Keywords

connectivitycycledegreepathtoughness

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Density (toughness, etc.) (05C42)

Cites Work

• Note on Hamilton Circuits
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Title not available (Why is that?)
• Some Theorems on Abstract Graphs
• Extending cycles in graphs
• Forbidden subgraphs that imply 2-factors
• Tough graphs and Hamiltonian circuits.
• Scenic graphs. I: Traceable graphs
• Proof techniques for factor theorems
• Non‐path spectrum sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs in which every path is contained in a Hamilton path.

Cited In (7)

• A sufficient condition for path extendable graphs
• Path extendability of \(s\)-vertex connected graphs
• Extending paths and degree sums in graphs
• End simplicial vertices in path graphs
• Extensibility of \(T_3\)-confined graphs
• Path extendability and degree sum in graphs.
• Path extendable graphs

This page was built for publication: Endpoint extendable paths in dense graphs

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