scientific article; zbMATH DE number 969092

MaRDI QIDQ5284558zbMATH OpenFDO

Authors Aaron L. Douthat, Man Cheong Kong

Publication date 22 June 1997

zbMATH Keywords

chordal graphgeodetic basisgeodetic covergeodetic numberpolynomial time algorithmsimplicial verticessplit graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1156614
• Some remarks on the geodetic number of a graph
• scientific article; zbMATH DE number 1145913
• scientific article; zbMATH DE number 5531985

Cited in

(9)

• On the approximation hardness of geodetic set and its variants
• Computing minimum geodetic sets of proper interval graphs
• scientific article; zbMATH DE number 1145913 (Why is no real title available?)
• scientific article; zbMATH DE number 1156614 (Why is no real title available?)
• Algorithms and complexity for geodetic sets on partial grids
• Algorithms and complexity for geodetic sets on interval and chordal graphs
• Algorithms and hardness for geodetic set on tree-like digraphs
• Geodetic set on graphs of constant pathwidth and feedback vertex set number
• Hitting geodesic intervals in structurally restricted graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284558)