MAKE A MEME View Large Image Tree-depth.svg tree-depth of a complete graph complete bipartite graph and path graph In each case the graph is shown with black edges and the underlying tree is shown with yellow edges; every graph edge connects an ancestor-descendant pair ...
View Original:Tree-depth.svg (666x252)
Download: Original    Medium    Small Thumb
Courtesy of:commons.wikimedia.org More Like This
Keywords: Tree-depth.svg tree-depth of a complete graph complete bipartite graph and path graph In each case the graph is shown with black edges and the underlying tree is shown with yellow edges; every graph edge connects an ancestor-descendant pair in the tree The complete graph K<sub>4</sub> and the complete bipartite graph K<sub>3 3</sub> both have tree-depth four while the path graph P<sub>7</sub> has tree-depth three 2012-08-07 own David Eppstein cc-zero Uploaded with UploadWizard Graph theory Files by User David Eppstein from en wikipedia
Terms of Use   Search of the Day