Note on terminal-pairability in complete grid graphs

DOI10.1016/j.disc.2017.01.014zbMath1357.05068arXiv1606.06826OpenAlexW2464960760MaRDI QIDQ512572

Gábor Mészáros, Tamás Róbert Mezei, Ervin Gyoeri

Publication date: 27 February 2017

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

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

zbMATH Keywords

complete grid graphspath-pairabilityterminal-pairability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (9)

Minimal 2-connected graphs satisfying the even cut condition ⋮ The terminal-pairability problem in complete bipartite graphs ⋮ On the maximum degree of path-pairable planar graphs ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Terminal-pairability in complete bipartite graphs ⋮ Note on the bisection width of cubic graphs ⋮ Note on terminal-pairability in complete grid graphs ⋮ On the maximum diameter of path-pairable graphs ⋮ The path-pairability number of product of stars

Cites Work

• Note on terminal-pairability in complete grid graphs
• On path-pairability in the Cartesian product of graphs
• Networks communicating for each pairing of terminals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on terminal-pairability in complete grid graphs