k-path-connectivity of the complete balanced tripartite graph K_n, n, n for n + 1 k 2 n - 4

DOI10.1016/J.DAM.2025.04.043MaRDI QIDQ6969940zbMATH OpenFDO

Authors Shasha Li, Xiaoxue Gao, Qihui Jin

Publication date 19 June 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.04.043

zbMATH Keywords

complete balanced tripartite graphsHamilton pathsinternally disjoint pathspath-connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites work

• 3-path-connectivity of Cayley graphs generated by transposition trees
• Conditional connectivity
• Congruent graphs and the connectivity of graphs
• Generalized Connectivity of Graphs
• Graph theory
• scientific article; zbMATH DE number 4023324 (Why is no real title available?)
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• On tree-connectivity and path-connectivity of graphs
• Path 3-(edge-)connectivity of lexicographic product graphs
• Path connectivity of line graphs and total graphs of complete bipartite graphs
• Path-connectivity in graphs
• Path-connectivity of lexicographic product graphs
• Pendant tree-connectivity
• Rainbow connection in graphs
• Rainbow connections of graphs
• The 3-path-connectivity of the \(k\)-ary \(n\)-cube
• The 3-path-connectivity of the hypercubes

Cited in

(2)

• k-path-edge-connectivity of the complete balanced bipartite graph
• k-path-connectivity of balanced hypercubes for k = 3, 4

This page was built for publication: \(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\)

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