Fan-type theorem for path-connectivity
From MaRDI portal
An \((x,y)\)-path in a graph \(G\) is a path with endvertices \(x\) and \(y\). Let \(d(x,y)\) denote the length of a shortest \((x,y)\)-path in \(G\). A graph \(G=(V,E)\) is \(k\)-path-connected if it contains an \((x,y)\)-path of length at least \(k\). Thus \(G\) is \((|V|-1)\)-path-connected if and only if it is hamiltonian-connected. In this paper, it is proved that if a 2-connected graph \(G=(V,E)\) satisfies \(\max\{d(x),d(y)\}\geq k\) whenever \(d(x,y)=2\), then \(G\) is \(k\)-path-connected.
Recommendations
- Fan‐type theorem for path‐connectivity
- Fan-type theorem for a long path passing through a specified vertex
- On the spanning fan-connectivity of graphs
- scientific article; zbMATH DE number 4125433
- Fan-type theorem for long cycles containing a specified edge
- A Cantor-Bernstein Theorem for Paths in Graphs
- Connectivity of path graphs
- scientific article; zbMATH DE number 1744097
- scientific article; zbMATH DE number 2172752
- A Fan-type condition for graphs to be \(k\)-leaf-connected
Cited in
(6)- Fan-type theorem for long cycles containing a specified edge
- Fan-type theorem for a long path passing through a specified vertex
- Fan‐type theorem for path‐connectivity
- scientific article; zbMATH DE number 810445 (Why is no real title available?)
- scientific article; zbMATH DE number 2201389 (Why is no real title available?)
- Path connectivity of line graphs and total graphs of complete bipartite graphs
This page was built for publication: Fan-type theorem for path-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563518)
