On some extremal position problems for graphs

DOI10.26493/1855-3974.3094.BC6MaRDI QIDQ7012448zbMATH OpenFDO

Authors James Tuite, Elias John Thomas, Ullas Chandran S. V.

Publication date 17 March 2025

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/1855-3974.3094.BC6

zbMATH Keywords

diametergeneral positioninduced pathmonophonic positionsizeTurán problems

Mathematics Subject Classification ID

Distance in graphs (05C12) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A general position problem in graph theory
• Algorithmic Aspects of Monophonic Convexity
• Complexity results related to monophonic convexity
• Eine Extremalaufgabe aus der Graphentheorie.
• Extreme Geodesic Graphs
• General d-position sets
• Graph theory with applications
• Graphs with specified radius and diameter
• scientific article; zbMATH DE number 3691361 (Why is no real title available?)
• Lower general position sets in graphs
• Network analysis. Methodological foundations.
• On monophonic position sets in graphs
• On the general position number of two classes of graphs
• On the geodetic number of a graph
• On the non-(p-1)-partite K_p-free graphs
• The general position number of Cartesian products involving a factor with small diameter
• The geodetic number of a graph
• The lower and upper forcing geodetic numbers of block--cactus graphs
• TRAVERSING A GRAPH IN GENERAL POSITION

Cited in

(2)

• Lower general position sets in graphs
• Three algorithmic approaches to the general position problem

This page was built for publication: On some extremal position problems for graphs

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