Pages that link to "Item:Q1779492"
From MaRDI portal
The following pages link to On the Steiner, geodetic and hull numbers of graphs (Q1779492):
Displaying 46 items.
- Some properties of the intersection graph for finite commutative principal ideal rings (Q471801) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- Convex sets in lexicographic products of graphs (Q659762) (← links)
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- On geodetic sets formed by boundary vertices (Q819808) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
- Monophonic numbers of the join and composition of connected graphs (Q870979) (← links)
- Convexity in partial cubes: the hull number (Q898152) (← links)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (Q941349) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Geodetic sets and Steiner sets in graphs (Q1043600) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- Toll number of the strong product of graphs (Q1712528) (← links)
- Toll number of the Cartesian and the lexicographic product of graphs (Q2012538) (← links)
- On the toll number of a graph (Q2172405) (← links)
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- Toll convexity (Q2255809) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- Geodetic number of powers of cycles (Q2333891) (← links)
- The restrained geodetic number of a graph (Q2350702) (← links)
- On pitfalls in computing the geodetic number of a graph (Q2463833) (← links)
- Geodeticity of the contour of chordal graphs (Q2482108) (← links)
- Orientable convexity, geodetic and hull numbers in graphs (Q2486069) (← links)
- On steiner sets and polynomials of wheels and helm graphs (Q2831144) (← links)
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (Q2840557) (← links)
- The forcing edge fixing edge-to-vertex monophonic number of a graph (Q2874047) (← links)
- On the Steiner Radial Number of Graphs (Q2876558) (← links)
- Some Steiner concepts on lexicographic products of graphs (Q2931926) (← links)
- On the (M, D) number of a graph (Q3294993) (← links)
- Some structural, metric and convex properties on the boundary of a graph (Q3439437) (← links)
- On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs (Q5013412) (← links)
- Connected monophonic domination in graphs (Q5013476) (← links)
- (Q5021246) (← links)
- The vertex steiner number of a graph (Q5139342) (← links)
- The upper restrained Steiner number of a graph (Q5216442) (← links)
- Analogies between the geodetic number and the Steiner number of some classes of graphs (Q5278703) (← links)
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs (Q5890507) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918550) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918666) (← links)
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs (Q5918774) (← links)
- The total outer connected monophonic number of a graph (Q6050413) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- A survey on the Intersection graphs of ideals of rings (Q6101486) (← links)
- Graphs with large Steiner number (Q6637381) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)
