Linkage on the infinite grid
From MaRDI portal
Publication:1641161
DOI10.1016/j.ipl.2018.05.001zbMath1478.68246OpenAlexW2804252637WikidataQ129807548 ScholiaQ129807548MaRDI QIDQ1641161
Jenő Lehel, Adam S. Jobson, André E. Kézdy
Publication date: 15 June 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2018.05.001
Related Items (4)
Minimal 2-connected graphs satisfying the even cut condition ⋮ The general position number of integer lattices ⋮ Note on the bisection width of cubic graphs ⋮ Path-pairability of infinite planar grids
Cites Work
- On path-pairability in the Cartesian product of graphs
- Multicommodity flows in planar graphs
- A sufficient condition for graphs to be weakly \(k\)-linked
- The point-to-point delivery and connection problems: Complexity and algorithms
- Escaping a grid by edge-disjoint paths
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Graph minors. XIII: The disjoint paths problem
- On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
- Networks communicating for each pairing of terminals
- Unnamed Item
This page was built for publication: Linkage on the infinite grid