Toll convexity

DOI10.1016/J.EJC.2015.01.002MaRDI QIDQ2255809zbMATH OpenOpenAlexFDO

Authors L. Alcón, Boštjan Brešar, T. Gologranc, M. Gutierrez, Tadeja Kraner Šumenjak, Iztok Peterin, Aleksandra Tepeh

Publication date 18 February 2015

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

Full work available at URL https://doi.org/10.1016/j.ejc.2015.01.002

zbMATH Keywords

toll convexitytolled walk

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Recommendations

• Computing the hull number in toll convexity
• Toll number of the Cartesian and the lexicographic product of graphs
• Toll number of the strong product of graphs
• On the toll number of a graph
• Forcing subsets for some types of convex sets in a graph

Cites work

• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 5499517 (Why is no real title available?)
• Convex sets in graphs. II: Minimal path convexity
• Convex sets in lexicographic products of graphs
• Convexity in Graphs and Hypergraphs
• End vertices in interval graphs
• Geodesic Convexity in Graphs
• Geodetic sets in graphs
• Graph Classes: A Survey
• Handbook of product graphs
• Incidence matrices and interval graphs
• Interval graphs: canonical representation in logspace
• Intervals and convex sets in strong product of graphs
• On local convexity in graphs
• On rigid circuit graphs
• On the Steiner, geodetic and hull numbers of graphs
• On the geodetic number of a graph
• On triangle path convexity in graphs
• Representation of a finite graph by a set of intervals on the real line
• Representing finite convex geometries by relatively convex sets
• Some Elementary Properties of Interval Convexities
• Steiner distance and convexity in graphs
• The All-Paths Transit Function of a Graph
• The hull number of a graph
• The longest path transit function of a graph and betweenness
• Topics in Intersection Graph Theory

Cited in

(16)

• Computing the hull and interval numbers in the weakly toll convexity
• Axiomatic characterization of the toll walk function of some graph classes
• Steiner convex sets and Cartesian product
• Weakly toll convexity and proper interval graphs
• Highway toll pricing
• Computing the hull number in toll convexity
• Toll path domination in graphs
• A note on path domination
• Forcing subsets for some types of convex sets in a graph
• Toll number of the Cartesian and the lexicographic product of graphs
• On the toll number of a graph
• Walk Domination and HHD-Free Graphs
• Characterizations of graph classes via convex geometries: a survey
• Toll number of the strong product of graphs
• Convex geometries over induced paths with bounded length
• The weak-toll function of a graph: axiomatic characterizations and first-order non-definability

This page was built for publication: Toll convexity

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