The good drawings D r of the complete graph K r /
This thesis treats some of the problems related to the good drawings D$ sb{ rm n}$ of the complete graph K$ sb{ rm n}$. The first of these problems is obtaining all the non-isomorphic good drawings D$ sb{ rm n}$ of K$ sb{ rm n}$. After conjecturing that any good drawing D$ sb{ rm n}$ of K$ sb{ rm n}...
Main Author: | Rafla, Nabil H. |
---|---|
Format: | Others |
Language: | en |
Published: |
McGill University
1988
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=75756 |
Similar Items
-
Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language
by: Gaconnet, Christopher James
Published: (2009) -
A new approach to complete graph
by: BASHEER AHAMED MOHIDEEN
Published: (2017-03-01) -
Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
by: Maumita Chakraborty, et al.
Published: (2018-01-01) -
Factorizations of complete graphs into tadpoles
by: Michael Kubesa, et al.
Published: (2020-09-01) -
On vertex stability of complete k-partite graphs
by: Mateusz Nikodem
Published: (2015-01-01)