Login / Signup
Non-bipartite pairs of 33-connected graphs are highly Ramsey-infinite.
Mark H. Siggers
Published in:
Eur. J. Comb. (2014)
Keyphrases
</>
connected graphs
pairwise
real valued
bipartite graph
graph model
real world
origin destination
case study
data structure
relational databases
co occurrence
finite sets