5 citations · 12 across the 13 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 1 cited
Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on t…
math.CO2017★ 3 cited
Terminal-Pairability in Complete Bipartite Graphs
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. W…