Pages that link to "Item:Q1708262"
From MaRDI portal
The following pages link to On the hardness of finding the geodetic number of a subcubic graph (Q1708262):
Displaying 13 items.
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- A general framework for path convexities (Q2156285) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
- Parameterized Complexity of Geodetic Set (Q5050005) (← 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)
- Target set selection with maximum activation time (Q6110610) (← links)
