Path extendable graphs

DOI10.1007/BF02651089zbMath0729.05027OpenAlexW1975564488MaRDI QIDQ805629

George R. T. Hendry

Publication date: 1990

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

panconnectedfully path extendablePLD-maximal

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Extremal and Degree Conditions for Path Extendability in Digraphs ⋮ Minimum degree and pan-\(k\)-linked graphs ⋮ Connectivity and extendability in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending cycles in graphs
• Hamilton connected graphs
• A note on locally connected and Hamiltonian-connected graphs
• On path connected graphs
• Theory of path length distributions. I
• Connected, locally 2-connected,K1,3-free graphs are panconnected
• On the hamiltonian path graph of a graph
• Path connected graphs
• On the Cube of a Graph

This page was built for publication: Path extendable graphs