On the complement connected Steiner number of a graph
From MaRDI portal
Recommendations
Cites work
- Algorithmic Aspects of Monophonic Convexity
- Analogies between the geodetic number and the Steiner number of some classes of graphs
- Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54]
- Edge geodetic self-decomposition in graphs
- Graphs with large geodetic number
- Graphs with large total geodetic number
- scientific article; zbMATH DE number 5904664 (Why is no real title available?)
- scientific article; zbMATH DE number 2170425 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Monophonic numbers of the join and composition of connected graphs
- On the forcing geodetic and forcing steiner numbers of a graph
- On the geodetic number of a graph
- On the Steiner, geodetic and hull numbers of graphs
- Steiner intervals, geodesic intervals, and betweenness
- The edge geodetic self decomposition number of a graph
- The forcing Steiner number of a graph
- The geodetic, hull, and Steiner numbers of powers of paths
- The Steiner number of a graph
- The total Steiner number of a graph
- The upper restrained Steiner number of a graph
- The vertex Steiner number of a graph
Cited in
(2)
This page was built for publication: On the complement connected Steiner number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021246)