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

DOI10.47443/DML.2024.014MaRDI QIDQ6561583FDOQ6561583

Authors: Vladyslav Haponenko, Sergiy Kozerenko 

Publication date: 25 June 2024

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

zbMATH Keywords

block graphgraph convexitygated setall-path convexityinterval spacegeneral position number

Mathematics Subject Classification ID

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

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distance-hereditary graphs
• A Characterization of Block-Graphs
• The All-Paths Transit Function of a Graph
• Convex sets in a graph
• Title not available (Why is that?)
• 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
• On the general position number of two classes of graphs
• 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

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