scientific article; zbMATH DE number 7771728

zbMath1527.05106arXiv2108.09821MaRDI QIDQ6072043

Ralph Morrison, Lisa Cenek, Unnamed Author, Unnamed Author, Unnamed Author, Unnamed Author, Unnamed Author, Unnamed Author

Publication date: 29 November 2023

Full work available at URL: https://arxiv.org/abs/2108.09821

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(k\)-restricted edge-connectivity\(k\)-edge-connectivity\(k\)-uniform scramble

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• \(k\)-restricted edge-connectivity in triangle-free graphs
• Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
• On the extra edge-connectivity of hypercubes
• Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
• A new lower bound on graph gonality
• On the scramble number of graphs
• Treewidth is a lower bound on graph gonality
• On the gonality of Cartesian products of graphs
• Cycles in folded hypercubes
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Gonality of random graphs
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Self-dual configurations and regular graphs

This page was built for publication: