scientific article; zbMATH DE number 3232669
From MaRDI portal
Publication:5520565
Cited in
(10)- The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
- Bounds for the rainbow disconnection numbers of graphs
- On graphs with at most four line-disjoint paths connecting any two vertices
- Ein Extremalproblem des Zusammenhangs von Graphen
- On a conjecture of Bollobas and Erdős
- On extremal graphs with exactly one Steiner tree connecting any k vertices
- Fast algorithm for the rainbow disconnection coloring of 2-trees
- On k-rails in graphs
- The rainbow vertex-disconnection in graphs
- On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5520565)
