End Simplicial Vertices in Path Graphs
A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV -model that is a path, called an...
-д хадгалсан:
| Үндсэн зохиолчид: | , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
University of Zielona Góra
2016-05-01
|
| Цуврал: | Discussiones Mathematicae Graph Theory |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://doi.org/10.7151/dmgt.1866 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|