A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces.
Hikari ShibuyaYusuke SuzukiPublished in: Discuss. Math. Graph Theory (2023)
Keyphrases
- upper bound
- lower bound
- graph model
- bipartite graph
- lower and upper bounds
- upper and lower bounds
- undirected graph
- graph partitioning
- graph structure
- computational complexity
- efficiently computable
- weighted graph
- graph matching
- three dimensional
- surface reconstruction
- branch and bound algorithm
- branch and bound
- graph theoretic
- worst case
- maximal cliques
- memory requirements
- graph representation
- directed graph
- tight bounds
- bounded degree
- uniform random