FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH

DOI10.17654/DM019010033zbMath1440.05074OpenAlexW2792318664MaRDI QIDQ4973382

Roxanne L. Arco, Sergio R. jun. Canoy

Publication date: 27 November 2019

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm019010033

zbMATH Keywords

detour convex setforcing detour convexity numberforcing toll convexity numbertoll convex set

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Convexity in graphs
• The convexity number of a graph
• Toll number of the Cartesian and the lexicographic product of graphs
• Toll convexity
• The Forcing Convexity Number of a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH