File:Tree-depth.svg
Summary
| Description |
English: The 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 K4 and the complete bipartite graph K3,3 both have tree-depth four, while the path graph P7 has tree-depth three. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
