Note on terminal-pairability in complete grid graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros. Note on terminal-pairability in complete grid graphs. Discrete Mathematics, 340(5):988-990, 2017. [doi]

The following publications are possibly variants of this publication:

Terminal-pairability in complete bipartite graphsLucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei. DAM, 236:459-463, 2018. [doi]

An improved upper bound on the maximum degree of terminal-pairable complete graphsAntónio Girão, Gábor Mészáros. DM, 341(9):2606-2607, 2018. [doi]

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphsLucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei. TCS, 775:16-25, 2019. [doi]

runs on WebDSL