A note on path domination
From MaRDI portal
Recommendations
Cites work
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A characterization of ptolemaic graphs
- A characterization of the interval function of a connected graph
- A note on superbrittle graphs
- Efficient graph representations
- Geodesic Convexity in Graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 1449370 (Why is no real title available?)
- scientific article; zbMATH DE number 5499517 (Why is no real title available?)
- On triangle path convexity in graphs
- Representation of a finite graph by a set of intervals on the real line
- The All-Paths Transit Function of a Graph
- The longest path transit function of a graph and betweenness
- Toll convexity
- Topics in Intersection Graph Theory
Cited in
(13)- A note on path-zero graphs
- Toll number of the strong product of graphs
- Toll number of the Cartesian and the lexicographic product of graphs
- The Domination Equivalence Classes of Paths
- Axiomatic characterization of the toll walk function of some graph classes
- Walk Domination and HHD-Free Graphs
- The weak-toll function of a graph: axiomatic characterizations and first-order non-definability
- Characterizations of graph classes via convex geometries: a survey
- The toll walk transit function of a graph: axiomatic characterizations and first-order non-definability
- Convex geometries yielded by transit functions
- Weakly toll convexity in graph products
- On a problem of L. Alcón concerning path domination
- On walk domination: weakly toll domination, l₂ and l₃ domination
This page was built for publication: A note on path domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339493)