A sufficient condition for path extendable graphs

MaRDI QIDQ3017701zbMATH OpenFDO

Authors Haiyan You, Qiang Zhao

Publication date 19 July 2011

zbMATH Keywords

degree of vertexdegree sumorder of graphpath extendable graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Path extendability and degree sum in graphs.
• Extending paths and degree sums in graphs
• Endpoint extendable paths in dense graphs
• Path extendable graphs
• scientific article; zbMATH DE number 2077671

Cited in

(7)

• Path extendability and degree sum in graphs.
• Path extendability of s-vertex connected graphs
• Core and Conditional Core Path of Specified Length in Special Classes of Graphs
• Endpoint extendable paths in dense graphs
• Extending paths and degree sums in graphs
• A necessary and sufficient condition for a graph to be edge tenacious
• Path extendable graphs

This page was built for publication: A sufficient condition for path extendable graphs

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