Toll convexity
DOI10.1016/J.EJC.2015.01.002zbMATH Open1307.05123OpenAlexW4205984163MaRDI QIDQ2255809FDOQ2255809
Aleksandra Tepeh, L. Alcón, Tadeja Kraner Šumenjak, M. Gutierrez, Iztok Peterin, T. Gologranc, Boštjan Brešar
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
Recommendations
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)
Cites Work
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- On local convexity in graphs
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convexity in Graphs and Hypergraphs
- On rigid circuit graphs
- End vertices in interval graphs
- Steiner distance and convexity in graphs
- Representing finite convex geometries by relatively convex sets
- Representation of a finite graph by a set of intervals on the real line
- Convex sets in graphs. II: Minimal path convexity
- On triangle path convexity in graphs
- On the geodetic number of a graph
- Geodesic Convexity in Graphs
- The hull number of a graph
- The All-Paths Transit Function of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval Graphs: Canonical Representation in Logspace
- Some Elementary Properties of Interval Convexities
- Convex sets in lexicographic products of graphs
- On the Steiner, geodetic and hull numbers of graphs
- Geodetic Sets in Graphs
- Intervals and convex sets in strong product of graphs
Cited In (15)
- FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH
- Steiner convex sets and Cartesian product
- Weakly toll convexity and proper interval graphs
- Highway toll pricing
- Computing the hull number in toll convexity
- A note on path domination
- 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
- The weak-toll function of a graph: axiomatic characterizations and first-order non-definability
- Convex geometries over induced paths with bounded length
- Computing the hull and interval numbers in the weakly toll convexity
- Axiomatic characterization of the toll walk function of some graph classes
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)
