Minimum edge ranking spanning trees of split graphs
From MaRDI portal
(Redirected from Publication:860397)
Recommendations
- On minimum edge ranking spanning trees
- scientific article; zbMATH DE number 1979519
- Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
- Minimum rank of edge subdivisions of graphs
- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
- On an edge ranking problem of trees and graphs
- Minimum spanning trees in networks with varying edge weights
- Spanning trees with minimum weighted degrees
- On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
Cites work
- Edge ranking of graphs is hard
- Fairness in routing and load balancing
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 1979519 (Why is no real title available?)
- On an edge ranking problem of trees and graphs
- On minimum edge ranking spanning trees
- Optimal edge ranking of trees in linear time
- Optimal edge ranking of trees in polynomial time
- Rankings of Graphs
- The splittance of a graph
- Threshold graphs and related topics
- Threshold Sequences
Cited in
(4)- On minimum edge ranking spanning trees
- On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
- scientific article; zbMATH DE number 1979519 (Why is no real title available?)
This page was built for publication: Minimum edge ranking spanning trees of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860397)