On the geodetic rank of a graph

From MaRDI portal

Revision as of 17:50, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2364865

Jump to:navigation, search

DOI10.4310/JOC.2017.v8.n2.a5zbMath1367.05202MaRDI QIDQ2364865

Vinícius Fernandes dos Santos, Rudini Menezes Sampaio, Mamadou Moustapha Kanté, Jayme Luiz Szwarcfiter

Publication date: 25 July 2017

Published in: Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

NP-completeness rank bipartite graphs inapproximability geodetic convexity \(P_3\)-convexity monophonic convexity \(P^\ast_3\)-convexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

On the monophonic rank of a graph ⋮ The general position number of Cartesian products involving a factor with small diameter ⋮ The general position problem and strong resolving graphs ⋮ Characterization of general position sets and its applications to cographs and bipartite graphs ⋮ On general position sets in Cartesian products ⋮ The general position problem on Kneser graphs and on some graph operations

This page was built for publication: On the geodetic rank of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2364865&oldid=14979836"