Pages that link to "Item:Q965962"
From MaRDI portal
The following pages link to Some remarks on the geodetic number of a graph (Q965962):
Displaying 35 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On the geodetic and the hull numbers in strong product graphs (Q630693) (← links)
- Towards a new framework for domination (Q651449) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity (Q1680878) (← links)
- Total restrained geodetic number of graphs (Q1696108) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- On the geodetic number of complementary prisms (Q1721934) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- On the toll number of a graph (Q2172405) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- The strong convexity spectra of grids (Q2409510) (← links)
- Strong edge geodetic problem in networks (Q2409583) (← links)
- On the contour of graphs (Q2446313) (← links)
- On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- Geodetic convexity and Kneser graphs (Q2698271) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
- Parameterized Complexity of Geodetic Set (Q5050005) (← links)
- On the edge geodetic and edge geodetic domination numbers of a graph (Q5212898) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- (Q6065396) (← links)
- Parameterized Complexity of Geodetic Set (Q6089667) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
