Some remarks on the geodetic number of a graph
From MaRDI portal
Publication:965962
DOI10.1016/J.DISC.2009.09.018zbMATH Open1209.05129OpenAlexW2110486245MaRDI QIDQ965962FDOQ965962
Authors: Mitre C. Dourado, Fábio Protti, Dieter Rautenbach, Jayme L. Szwarcfiter 
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00017414/IfM_Preprint_M_09_15.pdf
Recommendations
Cites Work
- Graph Classes: A Survey
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Title not available (Why is that?)
- On the geodetic number of a graph
- Title not available (Why is that?)
- Dominating Sets in Chordal Graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The geodetic number of a graph
- On geodetic sets formed by boundary vertices
- A short proof that `proper = unit'
- Title not available (Why is that?)
- On the Steiner, geodetic and hull numbers of graphs
- Title not available (Why is that?)
- Computational Complexity of Geodetic Set
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (61)
- Leanness computation: small values and special graph classes
- On the computational complexity of the strong geodetic recognition problem
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- The forcing geodetic global domination number of a graph
- Computing the hull and interval numbers in the weakly toll convexity
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- Computational Complexity of Geodetic Set
- On the geodetic number of complementary prisms
- Geodesics in graphs, an extremal set problem, and perfect hash families
- Algorithmic upper bounds for graph geodetic number
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- On the edge geodetic and edge geodetic domination numbers of a graph
- Strong geodetic cores and Cartesian product graphs
- Geodetic number of powers of cycles
- On pitfalls in computing the geodetic number of a graph
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- Title not available (Why is that?)
- Complexity aspects of the triangle path convexity
- Analogies between the geodetic number and the Steiner number of some classes of graphs
- On the geodetic and geodetic domination numbers of a graph
- Parameterized complexity of geodetic set
- The geodetic numbers of graphs and digraphs
- On the contour of bipartite graphs
- Hull and geodetic numbers for some classes of oriented graphs
- Hull and geodetic numbers for some classes of oriented graphs
- Complexity results related to monophonic convexity
- Well-partitioned chordal graphs
- On the geodetic and the hull numbers in strong product graphs
- Geodetic convexity parameters for \((q, q - 4)\)-graphs
- Towards a new framework for domination
- The geodesic-transversal problem
- Graphs with large total geodetic number
- Geodetic convexity and Kneser graphs
- Algorithms and complexity for geodetic sets on partial grids
- On The Edge Geodetic Number Of A Graph
- Title not available (Why is that?)
- Strong geodetic problem in networks
- Computing minimum geodetic sets of proper interval graphs
- Three problems on well-partitioned chordal graphs
- On the contour of graphs
- On the geodetic hull number of \(P_{k}\)-free graphs
- Strong geodetic problem on complete multipartite graphs
- On the toll number of a graph
- Geodetic convexity parameters for graphs with few short induced paths
- Hardness and approximation for the geodetic set problem in some graph classes
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity
- Strong edge geodetic problem in networks
- Total restrained geodetic number of graphs
- Further results on the outer connected geodetic number of a graph
- Geodesic packing in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inapproximability results for graph convexity parameters
- Title not available (Why is that?)
- On the geodetic number of median graphs
- The strong convexity spectra of grids
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Parameterized Complexity of Geodetic Set
- The convexity of induced paths of order three and applications: complexity aspects
- On the hardness of finding the geodetic number of a subcubic graph
- Partitioning a graph into convex sets
This page was built for publication: Some remarks on the geodetic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965962)
