All-path convexity: two characterizations, general position number, and one algorithm

DOI10.47443/dml.2024.014MaRDI QIDQ6561583

Vladyslav Haponenko, Sergiy Kozerenko

Publication date: 25 June 2024

Published in: DML. Discrete Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

interval spaceblock graphgraph convexitygated setall-path convexitygeneral position number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex sets in a graph
• Distance-hereditary graphs
• On the general position number of two classes of graphs
• The All-Paths Transit Function of a Graph
• A Characterization of Block-Graphs
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• Characterization of classes of graphs with large general position number
• On the general position problem on Kneser graphs
• Depth-First Search and Linear Graph Algorithms
• On monophonic position sets in graphs
• Tolerant Radon partitions on the all-paths convexity in graphs

This page was built for publication: All-path convexity: two characterizations, general position number, and one algorithm