On graphoidal length of a tree in terms of its diameter
From MaRDI portal
Recommendations
Cites work
- Acyclic graphoidal covers and path partitions in a graph
- Bounds on graphoidal length of a graph
- Domination in graphoidal covers of a graph
- Further results on domination in graphoidally covered graphs
- Graphoidal bipartite graphs
- Graphoidal covers and graphoidal covering number of a graph
- Graphs whose acyclic graphoidal covering number is one less than its maximum degree
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 6315767 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On the graphoidal covering number of a graph
- ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
Cited in
(7)- Tree-length equals branch-length
- Branchings in rooted graphs and the diameter of greedoids
- On graphs whose graphoidal length is half of its size
- Bounds on graphoidal length of a graph
- scientific article; zbMATH DE number 4168708 (Why is no real title available?)
- Tree-width and circumference of graphs
- Graphoidally independent infinite cactus
This page was built for publication: On graphoidal length of a tree in terms of its diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012367)