Diametral path graphs

DOI10.1007/3-540-60618-1_87OpenAlexW1577883397MaRDI QIDQ6122236

Dieter Kratsch, Jitender S. Deogun

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_87

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the Minimum Eccentricity Shortest Path Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm to compute a dominating path in an AT-free graph
• Permutation graphs: Connected domination and Steiner trees
• A survey of integrity
• Dominating cliques in chordal graphs
• Domination on Cocomparability Graphs
• Diameters in graphs

This page was built for publication: Diametral path graphs