Maximum graphs not spannable by \(r\) disjoint paths

DOI10.1016/S0012-365X(99)00056-4zbMATH Open0935.05056OpenAlexW2139302243MaRDI QIDQ1808830

Yanyan Li

Publication date: 1 February 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00056-4

zbMATH Keywords

extremal graphsHamiltonian graphsspanning paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Maximum non-path-connected graphs 👍 👎
• The maximum edge-disjoint paths problem in complete graphs 👍 👎
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices 👍 👎
• Maximum number of disjoint paths connecting specified terminals in a graph 👍 👎
• Maximum graphs non-Hamiltonian-connected from a vertex 👍 👎
• Maximum Edge-Disjoint Paths in k-Sums of Graphs 👍 👎
• Maximum Edge-Disjoint Paths Problem in Planar Graphs 👍 👎

This page was built for publication: Maximum graphs not spannable by \(r\) disjoint paths

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